java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:00:32,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:00:32,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:00:32,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:00:32,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:00:32,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:00:32,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:00:32,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:00:32,529 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:00:32,530 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:00:32,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:00:32,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:00:32,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:00:32,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:00:32,534 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:00:32,535 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:00:32,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:00:32,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:00:32,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:00:32,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:00:32,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:00:32,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:00:32,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:00:32,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:00:32,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:00:32,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:00:32,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:00:32,558 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:00:32,561 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:00:32,563 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:00:32,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:00:32,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:00:32,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:00:32,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:00:32,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:00:32,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:00:32,571 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 09:00:32,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:00:32,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:00:32,590 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:00:32,590 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:00:32,590 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:00:32,590 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:00:32,590 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:00:32,591 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:00:32,591 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:00:32,591 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:00:32,591 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:00:32,592 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:00:32,592 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:00:32,592 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:00:32,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:00:32,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:00:32,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:00:32,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:00:32,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:00:32,594 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:00:32,594 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:00:32,594 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:00:32,595 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:00:32,595 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:00:32,595 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:00:32,595 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:00:32,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:00:32,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:00:32,596 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:00:32,596 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:00:32,596 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:00:32,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:00:32,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:00:32,597 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:00:32,597 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:00:32,597 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:00:32,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:00:32,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:00:32,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:00:32,684 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:00:32,684 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:00:32,685 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-10-27 09:00:32,756 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/203d38647/c2ae3cfc5afa4017b00788a344e4bedd/FLAG0f0b45b3d [2018-10-27 09:00:33,212 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:00:33,212 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-10-27 09:00:33,221 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/203d38647/c2ae3cfc5afa4017b00788a344e4bedd/FLAG0f0b45b3d [2018-10-27 09:00:33,244 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/203d38647/c2ae3cfc5afa4017b00788a344e4bedd [2018-10-27 09:00:33,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:00:33,260 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:00:33,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:00:33,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:00:33,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:00:33,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e22e728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33, skipping insertion in model container [2018-10-27 09:00:33,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:00:33,307 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:00:33,514 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:00:33,526 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:00:33,553 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:00:33,576 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:00:33,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33 WrapperNode [2018-10-27 09:00:33,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:00:33,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:00:33,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:00:33,578 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:00:33,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:00:33,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:00:33,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:00:33,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:00:33,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... [2018-10-27 09:00:33,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:00:33,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:00:33,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:00:33,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:00:33,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:00:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:00:33,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:00:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-10-27 09:00:33,864 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-10-27 09:00:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:00:33,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:00:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:00:33,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:00:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:00:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:00:34,319 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:00:34,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:00:34 BoogieIcfgContainer [2018-10-27 09:00:34,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:00:34,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:00:34,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:00:34,325 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:00:34,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:00:33" (1/3) ... [2018-10-27 09:00:34,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385acd34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:00:34, skipping insertion in model container [2018-10-27 09:00:34,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:33" (2/3) ... [2018-10-27 09:00:34,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385acd34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:00:34, skipping insertion in model container [2018-10-27 09:00:34,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:00:34" (3/3) ... [2018-10-27 09:00:34,329 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search_false-unreach-call.i [2018-10-27 09:00:34,340 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:00:34,348 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:00:34,366 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:00:34,401 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:00:34,401 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:00:34,401 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:00:34,401 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:00:34,401 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:00:34,402 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:00:34,402 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:00:34,402 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:00:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-27 09:00:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 09:00:34,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:34,427 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:34,429 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:34,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:34,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1855752643, now seen corresponding path program 1 times [2018-10-27 09:00:34,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:34,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:34,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:34,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:34,493 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:34,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:34,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:00:34,633 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:34,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:00:34,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:00:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:00:34,656 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-10-27 09:00:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:34,679 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-10-27 09:00:34,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:00:34,681 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-10-27 09:00:34,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:34,690 INFO L225 Difference]: With dead ends: 45 [2018-10-27 09:00:34,690 INFO L226 Difference]: Without dead ends: 22 [2018-10-27 09:00:34,694 INFO L605 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-10-27 09:00:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-27 09:00:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-27 09:00:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 09:00:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-10-27 09:00:34,734 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-10-27 09:00:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:34,734 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-10-27 09:00:34,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:00:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-10-27 09:00:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 09:00:34,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:34,736 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-10-27 09:00:34,736 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:34,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:34,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1049182020, now seen corresponding path program 1 times [2018-10-27 09:00:34,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:34,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:34,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:34,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:34,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:35,144 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-10-27 09:00:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:35,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:35,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 09:00:35,381 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:35,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:00:35,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:00:35,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:00:35,386 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2018-10-27 09:00:35,604 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 09:00:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:35,883 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-10-27 09:00:35,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:00:35,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-27 09:00:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:35,889 INFO L225 Difference]: With dead ends: 41 [2018-10-27 09:00:35,889 INFO L226 Difference]: Without dead ends: 33 [2018-10-27 09:00:35,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-27 09:00:35,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-27 09:00:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-10-27 09:00:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 09:00:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-10-27 09:00:35,899 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 20 [2018-10-27 09:00:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:35,900 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-10-27 09:00:35,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:00:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-10-27 09:00:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 09:00:35,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:35,901 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-10-27 09:00:35,902 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:35,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1502974941, now seen corresponding path program 1 times [2018-10-27 09:00:35,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:35,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:35,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:35,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:35,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:36,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:36,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 09:00:36,028 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:36,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:00:36,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:00:36,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:00:36,030 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 6 states. [2018-10-27 09:00:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:36,163 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-10-27 09:00:36,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:00:36,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-27 09:00:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:36,166 INFO L225 Difference]: With dead ends: 35 [2018-10-27 09:00:36,166 INFO L226 Difference]: Without dead ends: 26 [2018-10-27 09:00:36,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 09:00:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-27 09:00:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-27 09:00:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 09:00:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-10-27 09:00:36,173 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-10-27 09:00:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:36,173 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-10-27 09:00:36,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:00:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-10-27 09:00:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 09:00:36,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:36,175 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-10-27 09:00:36,175 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:36,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:36,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1442209030, now seen corresponding path program 1 times [2018-10-27 09:00:36,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:36,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:36,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:36,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:36,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:36,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-10-27 09:00:36,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:36,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 09:00:36,394 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:36,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:00:36,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:00:36,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:00:36,395 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-10-27 09:00:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:36,504 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-10-27 09:00:36,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:00:36,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 09:00:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:36,507 INFO L225 Difference]: With dead ends: 36 [2018-10-27 09:00:36,507 INFO L226 Difference]: Without dead ends: 27 [2018-10-27 09:00:36,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:00:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-27 09:00:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-27 09:00:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 09:00:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-10-27 09:00:36,514 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-10-27 09:00:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:36,515 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-10-27 09:00:36,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:00:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-10-27 09:00:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 09:00:36,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:36,516 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:36,516 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:36,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash -469535236, now seen corresponding path program 1 times [2018-10-27 09:00:36,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:36,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:36,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:36,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 09:00:36,718 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:36,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 09:00:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 09:00:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 09:00:36,720 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-10-27 09:00:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:36,894 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-10-27 09:00:36,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:00:36,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-10-27 09:00:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:36,899 INFO L225 Difference]: With dead ends: 49 [2018-10-27 09:00:36,902 INFO L226 Difference]: Without dead ends: 34 [2018-10-27 09:00:36,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:00:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-27 09:00:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-10-27 09:00:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 09:00:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-10-27 09:00:36,916 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2018-10-27 09:00:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:36,916 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-10-27 09:00:36,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 09:00:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-10-27 09:00:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 09:00:36,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:36,918 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:36,918 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:36,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash -862562246, now seen corresponding path program 1 times [2018-10-27 09:00:36,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:36,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:36,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:36,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:36,922 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:37,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:37,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 09:00:37,174 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:37,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 09:00:37,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 09:00:37,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 09:00:37,176 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 4 states. [2018-10-27 09:00:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:37,257 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-10-27 09:00:37,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 09:00:37,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-10-27 09:00:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:37,263 INFO L225 Difference]: With dead ends: 52 [2018-10-27 09:00:37,263 INFO L226 Difference]: Without dead ends: 39 [2018-10-27 09:00:37,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 09:00:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-27 09:00:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-10-27 09:00:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-27 09:00:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-27 09:00:37,274 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 25 [2018-10-27 09:00:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:37,274 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-27 09:00:37,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 09:00:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-27 09:00:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 09:00:37,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:37,276 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:37,276 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:37,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:37,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1056341250, now seen corresponding path program 1 times [2018-10-27 09:00:37,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:37,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:37,278 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:37,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:37,723 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:37,724 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-27 09:00:37,727 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [17], [19], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-10-27 09:00:37,763 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:00:37,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:00:38,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:00:38,165 INFO L272 AbstractInterpreter]: Visited 22 different actions 40 times. Merged at 8 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 29 variables. [2018-10-27 09:00:38,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:38,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:00:38,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:38,212 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:00:38,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:38,227 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:00:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:38,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 09:00:38,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 09:00:39,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:39,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2018-10-27 09:00:39,110 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:39,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 09:00:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 09:00:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:00:39,113 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 12 states. [2018-10-27 09:00:39,719 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-10-27 09:00:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:40,130 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-10-27 09:00:40,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 09:00:40,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-10-27 09:00:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:40,132 INFO L225 Difference]: With dead ends: 51 [2018-10-27 09:00:40,132 INFO L226 Difference]: Without dead ends: 39 [2018-10-27 09:00:40,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-10-27 09:00:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-27 09:00:40,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-10-27 09:00:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-27 09:00:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-27 09:00:40,139 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2018-10-27 09:00:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:40,140 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-27 09:00:40,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 09:00:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-27 09:00:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 09:00:40,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:40,141 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:40,142 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:40,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:40,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1449368260, now seen corresponding path program 1 times [2018-10-27 09:00:40,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:40,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:40,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:40,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:40,144 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:40,696 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 27 [2018-10-27 09:00:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:41,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:41,037 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:41,037 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-27 09:00:41,038 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [13], [17], [19], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-10-27 09:00:41,040 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:00:41,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:00:41,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:00:41,180 INFO L272 AbstractInterpreter]: Visited 23 different actions 52 times. Merged at 9 different actions 23 times. Never widened. Found 8 fixpoints after 4 different actions. Largest state had 29 variables. [2018-10-27 09:00:41,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:41,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:00:41,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:41,196 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:00:41,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:41,205 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:00:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:41,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:41,272 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 09:00:41,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:47,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-27 09:00:47,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:00:47,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:47,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:47,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:47,407 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 09:00:47,877 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 09:00:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:48,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:48,389 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-27 09:00:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:49,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:49,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2018-10-27 09:00:49,378 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:49,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 09:00:49,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 09:00:49,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-10-27 09:00:49,380 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-10-27 09:00:49,630 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-10-27 09:00:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:50,173 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-10-27 09:00:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:00:50,174 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-10-27 09:00:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:50,175 INFO L225 Difference]: With dead ends: 45 [2018-10-27 09:00:50,175 INFO L226 Difference]: Without dead ends: 35 [2018-10-27 09:00:50,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-10-27 09:00:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-27 09:00:50,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-10-27 09:00:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-27 09:00:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-27 09:00:50,184 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2018-10-27 09:00:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:50,184 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-27 09:00:50,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 09:00:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-27 09:00:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 09:00:50,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:50,186 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:50,186 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:50,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 890023736, now seen corresponding path program 1 times [2018-10-27 09:00:50,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:50,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:50,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:50,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:50,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:50,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:50,430 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:50,430 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-27 09:00:50,431 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [13], [17], [19], [22], [24], [32], [33], [37], [39], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-10-27 09:00:50,433 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:00:50,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:00:50,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:00:50,546 INFO L272 AbstractInterpreter]: Visited 24 different actions 55 times. Merged at 10 different actions 23 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 29 variables. [2018-10-27 09:00:50,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:50,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:00:50,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:50,586 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:00:50,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:50,637 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:00:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:50,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:50,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:50,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:50,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-10-27 09:00:50,839 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:50,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 09:00:50,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 09:00:50,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:00:50,840 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2018-10-27 09:00:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:50,907 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-10-27 09:00:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:00:50,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-27 09:00:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:50,908 INFO L225 Difference]: With dead ends: 57 [2018-10-27 09:00:50,908 INFO L226 Difference]: Without dead ends: 44 [2018-10-27 09:00:50,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:00:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-27 09:00:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-10-27 09:00:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 09:00:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-10-27 09:00:50,916 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-10-27 09:00:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:50,916 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-10-27 09:00:50,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 09:00:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-10-27 09:00:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 09:00:50,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:50,917 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:50,917 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:50,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:50,918 INFO L82 PathProgramCache]: Analyzing trace with hash 303217722, now seen corresponding path program 2 times [2018-10-27 09:00:50,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:50,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:50,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:50,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:50,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:57,373 WARN L179 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 102 DAG size of output: 30 [2018-10-27 09:00:57,947 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2018-10-27 09:00:58,152 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-10-27 09:00:58,392 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2018-10-27 09:01:00,338 WARN L179 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-10-27 09:01:00,844 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-10-27 09:01:03,203 WARN L179 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2018-10-27 09:01:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:03,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:03,212 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:01:03,212 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:01:03,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:01:03,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:03,212 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:01:03,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:01:03,227 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:01:03,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 09:01:03,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:01:03,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:01:03,343 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 09:01:03,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:03,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-27 09:01:03,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:01:03,449 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:03,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:03,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:03,458 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 09:01:06,423 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-10-27 09:01:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:06,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:01:06,760 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-27 09:01:07,030 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-10-27 09:01:07,596 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-27 09:01:08,179 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-27 09:01:08,464 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-27 09:01:08,713 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-27 09:01:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:08,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:01:08,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2018-10-27 09:01:08,758 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:01:08,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 09:01:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 09:01:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=913, Unknown=1, NotChecked=0, Total=1056 [2018-10-27 09:01:08,760 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 23 states. [2018-10-27 09:01:09,106 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-10-27 09:01:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:01:12,022 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-10-27 09:01:12,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 09:01:12,022 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-10-27 09:01:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:01:12,024 INFO L225 Difference]: With dead ends: 50 [2018-10-27 09:01:12,024 INFO L226 Difference]: Without dead ends: 40 [2018-10-27 09:01:12,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=230, Invalid=1175, Unknown=1, NotChecked=0, Total=1406 [2018-10-27 09:01:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-27 09:01:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-27 09:01:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-27 09:01:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-27 09:01:12,033 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 30 [2018-10-27 09:01:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:01:12,033 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-27 09:01:12,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 09:01:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-27 09:01:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 09:01:12,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:01:12,035 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:01:12,035 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:01:12,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:01:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash 411764474, now seen corresponding path program 2 times [2018-10-27 09:01:12,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:01:12,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:12,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:01:12,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:12,037 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:01:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:12,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:12,152 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:01:12,152 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:01:12,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:01:12,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:12,153 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:01:12,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:01:12,161 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:01:12,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 09:01:12,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:01:12,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:01:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:12,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:01:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:12,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:01:12,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-10-27 09:01:12,408 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:01:12,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 09:01:12,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 09:01:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:01:12,409 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2018-10-27 09:01:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:01:12,618 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-10-27 09:01:12,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:01:12,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-10-27 09:01:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:01:12,620 INFO L225 Difference]: With dead ends: 62 [2018-10-27 09:01:12,620 INFO L226 Difference]: Without dead ends: 49 [2018-10-27 09:01:12,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:01:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-27 09:01:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-10-27 09:01:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 09:01:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-10-27 09:01:12,630 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2018-10-27 09:01:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:01:12,631 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-10-27 09:01:12,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 09:01:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-10-27 09:01:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 09:01:12,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:01:12,632 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:01:12,632 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:01:12,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:01:12,633 INFO L82 PathProgramCache]: Analyzing trace with hash -175041540, now seen corresponding path program 3 times [2018-10-27 09:01:12,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:01:12,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:12,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:01:12,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:12,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:01:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:13,341 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 29 [2018-10-27 09:01:13,720 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 23 [2018-10-27 09:01:14,446 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 56 [2018-10-27 09:01:14,750 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2018-10-27 09:01:15,019 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 58 [2018-10-27 09:01:15,518 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2018-10-27 09:01:15,712 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2018-10-27 09:01:16,001 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2018-10-27 09:01:16,503 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2018-10-27 09:01:16,758 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 31 [2018-10-27 09:01:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:16,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:16,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:01:16,768 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:01:16,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:01:16,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:16,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:01:16,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:01:16,778 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:01:16,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:01:16,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:01:16,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:01:16,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-10-27 09:01:16,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:01:16,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:16,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:16,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-27 09:01:16,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:01:16,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:16,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:18,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:18,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 09:01:19,691 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-10-27 09:01:21,608 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-10-27 09:01:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:22,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:01:22,703 WARN L179 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2018-10-27 09:01:23,503 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-10-27 09:01:24,312 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-27 09:01:24,598 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-27 09:01:25,002 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 09:01:25,866 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2018-10-27 09:01:26,210 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-27 09:01:26,570 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 09:01:27,247 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-10-27 09:01:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:27,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:01:27,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2018-10-27 09:01:27,304 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:01:27,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 09:01:27,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 09:01:27,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1923, Unknown=0, NotChecked=0, Total=2162 [2018-10-27 09:01:27,306 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 32 states. [2018-10-27 09:01:27,947 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2018-10-27 09:01:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:01:28,897 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-27 09:01:28,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 09:01:28,898 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2018-10-27 09:01:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:01:28,899 INFO L225 Difference]: With dead ends: 55 [2018-10-27 09:01:28,899 INFO L226 Difference]: Without dead ends: 45 [2018-10-27 09:01:28,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=364, Invalid=2498, Unknown=0, NotChecked=0, Total=2862 [2018-10-27 09:01:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-27 09:01:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-27 09:01:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-27 09:01:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-10-27 09:01:28,910 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-10-27 09:01:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:01:28,910 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-10-27 09:01:28,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 09:01:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-10-27 09:01:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 09:01:28,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:01:28,912 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:01:28,912 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:01:28,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:01:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1953970296, now seen corresponding path program 3 times [2018-10-27 09:01:28,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:01:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:28,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:01:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:28,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:01:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:29,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:29,967 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:01:29,967 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:01:29,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:01:29,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:29,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:01:29,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:01:29,976 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:01:30,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:01:30,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:01:30,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:01:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:30,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:01:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:30,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:01:30,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-27 09:01:30,188 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:01:30,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 09:01:30,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 09:01:30,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:01:30,190 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 11 states. [2018-10-27 09:01:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:01:30,325 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-10-27 09:01:30,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:01:30,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-10-27 09:01:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:01:30,327 INFO L225 Difference]: With dead ends: 67 [2018-10-27 09:01:30,327 INFO L226 Difference]: Without dead ends: 54 [2018-10-27 09:01:30,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:01:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-27 09:01:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-10-27 09:01:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 09:01:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-10-27 09:01:30,336 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-10-27 09:01:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:01:30,336 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-10-27 09:01:30,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 09:01:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-10-27 09:01:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 09:01:30,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:01:30,338 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:01:30,338 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:01:30,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:01:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1367164282, now seen corresponding path program 4 times [2018-10-27 09:01:30,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:01:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:30,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:01:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:30,339 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:01:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:32,692 WARN L179 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 111 DAG size of output: 24 [2018-10-27 09:01:33,217 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 31 [2018-10-27 09:01:35,493 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2018-10-27 09:01:35,776 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2018-10-27 09:01:36,065 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2018-10-27 09:01:36,224 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2018-10-27 09:01:38,736 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse13 (div c_~SIZE~0 4294967296))) (let ((.cse9 (* 4294967296 .cse13))) (and (let ((.cse11 (* 2 (div c_~SIZE~0 2)))) (let ((.cse4 (= .cse11 c_~SIZE~0)) (.cse6 (<= .cse9 c_~SIZE~0)) (.cse10 (div (+ c_~SIZE~0 (* (- 4294967296) .cse13)) 2))) (let ((.cse0 (div .cse10 4294967296)) (.cse1 (or .cse4 .cse6)) (.cse12 (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse9)))) (.cse5 (div (+ .cse10 1) 4294967296)) (.cse2 (not .cse4)) (.cse3 (< c_~SIZE~0 .cse9))) (or (and (<= (+ .cse0 1) 0) .cse1) (let ((.cse8 (* 8589934592 .cse13))) (and (or (and (or (and .cse2 .cse3) (< 0 .cse0)) (or .cse4 (< 0 .cse5) .cse6)) (and (let ((.cse7 (<= (+ c_~SIZE~0 1) .cse9))) (or .cse7 (and (or (not (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (- (+ .cse8 (* (- 2) c_~SIZE~0)))) |c_linear_search_#in~q|)) (< (+ .cse9 (* 2 .cse10)) c_~SIZE~0)) (or (<= c_~SIZE~0 .cse11) (<= (+ .cse9 4294967300) c_~SIZE~0) (<= (+ .cse11 2) c_~SIZE~0) .cse7 .cse12)))) (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse9 4294967296))))) (or (<= (* 2 c_~SIZE~0) (+ .cse8 8)) (and (<= .cse0 0) .cse1) (and .cse2 (<= .cse5 0) .cse3)))) .cse12 (and (<= (+ .cse5 1) 0) .cse2 .cse3))))) (<= c_~SIZE~0 (+ .cse9 4))))) (not (= 0 |c_linear_search_#in~a.offset|))) is different from true [2018-10-27 09:01:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:38,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:38,750 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:01:38,750 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:01:38,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:01:38,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:38,750 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:01:38,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:01:38,758 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:01:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:38,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:01:38,844 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 09:01:38,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-27 09:01:38,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:01:38,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,891 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 09:01:39,776 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-10-27 09:01:40,506 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-10-27 09:01:42,501 WARN L179 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2018-10-27 09:01:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:42,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:01:43,065 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 97 [2018-10-27 09:01:43,432 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 09:01:45,286 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-27 09:01:45,842 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-27 09:01:46,537 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-10-27 09:01:47,006 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 09:01:49,442 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 09:01:50,200 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-10-27 09:01:51,694 WARN L179 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2018-10-27 09:01:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:51,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:01:51,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 20] total 50 [2018-10-27 09:01:51,797 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:01:51,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 09:01:51,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 09:01:51,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2136, Unknown=3, NotChecked=94, Total=2450 [2018-10-27 09:01:51,800 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 32 states. [2018-10-27 09:01:52,345 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-10-27 09:01:52,633 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-27 09:01:53,304 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2018-10-27 09:01:54,276 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2018-10-27 09:01:54,843 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2018-10-27 09:01:55,571 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2018-10-27 09:01:56,470 WARN L179 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2018-10-27 09:01:56,865 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 64 [2018-10-27 09:01:57,332 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2018-10-27 09:01:57,664 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 75 [2018-10-27 09:01:57,935 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2018-10-27 09:02:02,242 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 174 DAG size of output: 69 [2018-10-27 09:02:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:02,734 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-10-27 09:02:02,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 09:02:02,735 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-10-27 09:02:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:02,736 INFO L225 Difference]: With dead ends: 60 [2018-10-27 09:02:02,736 INFO L226 Difference]: Without dead ends: 50 [2018-10-27 09:02:02,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=428, Invalid=3733, Unknown=3, NotChecked=126, Total=4290 [2018-10-27 09:02:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-27 09:02:02,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-27 09:02:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-27 09:02:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-10-27 09:02:02,748 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 40 [2018-10-27 09:02:02,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:02,749 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-10-27 09:02:02,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 09:02:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-10-27 09:02:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 09:02:02,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:02,750 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:02,750 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:02,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:02,751 INFO L82 PathProgramCache]: Analyzing trace with hash 545539514, now seen corresponding path program 4 times [2018-10-27 09:02:02,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:02,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:02,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:02,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:02,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:04,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:04,369 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:04,370 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:04,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:04,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:04,370 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:02:04,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:04,378 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:02:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:04,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:04,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:04,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:02:04,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-10-27 09:02:04,791 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:02:04,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 09:02:04,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 09:02:04,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-10-27 09:02:04,792 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 13 states. [2018-10-27 09:02:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:05,142 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-10-27 09:02:05,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 09:02:05,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-10-27 09:02:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:05,143 INFO L225 Difference]: With dead ends: 72 [2018-10-27 09:02:05,143 INFO L226 Difference]: Without dead ends: 59 [2018-10-27 09:02:05,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-10-27 09:02:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-27 09:02:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-10-27 09:02:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-27 09:02:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-10-27 09:02:05,153 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2018-10-27 09:02:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:05,154 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-10-27 09:02:05,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 09:02:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-10-27 09:02:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 09:02:05,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:05,155 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:05,155 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:05,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash -41266500, now seen corresponding path program 5 times [2018-10-27 09:02:05,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:05,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:05,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:05,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:05,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:06,110 WARN L179 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 28 [2018-10-27 09:02:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:07,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:07,389 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:07,389 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:07,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:07,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:07,389 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:02:07,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:02:07,399 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:02:27,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-27 09:02:27,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:02:27,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:27,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-10-27 09:02:27,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:02:27,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-10-27 09:02:29,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:02:29,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,638 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 09:02:29,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,640 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 09:02:29,640 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-10-27 09:02:29,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:02:29,661 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,678 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 09:02:29,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:02:29,691 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,705 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:02:29,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 09:02:29,798 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:445, output treesize:66 [2018-10-27 09:02:30,542 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 09:02:31,212 WARN L179 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-27 09:02:31,890 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 09:02:33,787 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-27 09:02:34,327 WARN L179 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 09:02:35,009 WARN L179 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 09:02:37,619 WARN L179 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-27 09:02:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:37,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:38,343 WARN L179 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 92 [2018-10-27 09:02:38,508 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-10-27 09:02:39,301 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-10-27 09:02:40,366 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-10-27 09:02:40,737 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-27 09:02:41,018 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 09:02:41,503 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-10-27 09:02:41,897 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-27 09:02:42,526 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 09:02:43,094 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-27 09:02:44,407 WARN L179 SmtUtils]: Spent 989.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-27 09:02:45,764 WARN L179 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2018-10-27 09:02:46,507 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-10-27 09:02:48,088 WARN L179 SmtUtils]: Spent 910.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-27 09:02:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:48,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:02:48,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 21] total 52 [2018-10-27 09:02:48,156 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:02:48,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 09:02:48,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 09:02:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2393, Unknown=0, NotChecked=0, Total=2652 [2018-10-27 09:02:48,158 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 33 states. [2018-10-27 09:02:49,305 WARN L179 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-27 09:02:51,153 WARN L179 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-27 09:02:52,039 WARN L179 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-10-27 09:02:52,423 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-27 09:02:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:52,583 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-10-27 09:02:52,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 09:02:52,584 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2018-10-27 09:02:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:52,585 INFO L225 Difference]: With dead ends: 65 [2018-10-27 09:02:52,585 INFO L226 Difference]: Without dead ends: 55 [2018-10-27 09:02:52,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=383, Invalid=2923, Unknown=0, NotChecked=0, Total=3306 [2018-10-27 09:02:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-27 09:02:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-27 09:02:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-27 09:02:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-10-27 09:02:52,595 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 45 [2018-10-27 09:02:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:52,595 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-10-27 09:02:52,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-27 09:02:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-10-27 09:02:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 09:02:52,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:52,596 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:52,597 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:52,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:52,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1808322120, now seen corresponding path program 5 times [2018-10-27 09:02:52,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:52,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:52,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:02:52,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:52,598 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:52,889 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-10-27 09:02:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:59,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:59,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:59,872 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:59,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:59,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:59,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:02:59,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:02:59,880 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:03:00,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-27 09:03:00,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:00,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:00,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:01,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:01,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-10-27 09:03:01,090 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:01,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 09:03:01,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 09:03:01,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=322, Unknown=2, NotChecked=0, Total=462 [2018-10-27 09:03:01,091 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 15 states. [2018-10-27 09:03:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:01,351 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-10-27 09:03:01,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:03:01,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-10-27 09:03:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:01,352 INFO L225 Difference]: With dead ends: 77 [2018-10-27 09:03:01,353 INFO L226 Difference]: Without dead ends: 64 [2018-10-27 09:03:01,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=138, Invalid=322, Unknown=2, NotChecked=0, Total=462 [2018-10-27 09:03:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-27 09:03:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-10-27 09:03:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 09:03:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-10-27 09:03:01,362 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-10-27 09:03:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:01,362 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-10-27 09:03:01,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 09:03:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-10-27 09:03:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 09:03:01,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:01,364 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:01,364 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:01,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:01,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1899839162, now seen corresponding path program 6 times [2018-10-27 09:03:01,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:01,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:01,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:01,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:01,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:03,760 WARN L179 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 120 DAG size of output: 26 [2018-10-27 09:03:03,960 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2018-10-27 09:03:04,099 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 31 [2018-10-27 09:03:04,785 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2018-10-27 09:03:04,973 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-10-27 09:03:05,129 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2018-10-27 09:03:05,406 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2018-10-27 09:03:05,792 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 35 [2018-10-27 09:03:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:05,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:05,810 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:05,811 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:05,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:05,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:05,811 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:03:05,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:03:05,818 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:03:05,959 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:03:05,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:05,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:05,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-27 09:03:05,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:03:05,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:05,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:05,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-10-27 09:03:05,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:03:05,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:06,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:12,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:12,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 09:03:12,976 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 09:03:14,414 WARN L179 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-10-27 09:03:15,016 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-27 09:03:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:15,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:16,287 WARN L179 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 115 [2018-10-27 09:03:18,447 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 09:03:18,729 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 09:03:19,084 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-27 09:03:19,535 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 09:03:20,132 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2018-10-27 09:03:20,834 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-10-27 09:03:21,694 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-27 09:03:22,523 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-27 09:03:24,407 WARN L179 SmtUtils]: Spent 925.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-10-27 09:03:26,237 WARN L179 SmtUtils]: Spent 847.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-27 09:03:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:26,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:26,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 56 [2018-10-27 09:03:26,318 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:26,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-27 09:03:26,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-27 09:03:26,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2848, Unknown=0, NotChecked=0, Total=3080 [2018-10-27 09:03:26,321 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 37 states. [2018-10-27 09:03:26,848 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-10-27 09:03:27,537 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-10-27 09:03:28,575 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-10-27 09:03:29,380 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-10-27 09:03:31,645 WARN L179 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-10-27 09:03:32,391 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 83 [2018-10-27 09:03:33,148 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2018-10-27 09:03:34,550 WARN L179 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-10-27 09:03:34,887 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2018-10-27 09:03:35,333 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2018-10-27 09:03:35,631 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 67 [2018-10-27 09:03:35,906 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2018-10-27 09:03:36,130 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2018-10-27 09:03:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:36,240 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-10-27 09:03:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 09:03:36,241 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50 [2018-10-27 09:03:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:36,242 INFO L225 Difference]: With dead ends: 70 [2018-10-27 09:03:36,242 INFO L226 Difference]: Without dead ends: 60 [2018-10-27 09:03:36,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=465, Invalid=5085, Unknown=0, NotChecked=0, Total=5550 [2018-10-27 09:03:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-27 09:03:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-10-27 09:03:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 09:03:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-10-27 09:03:36,252 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 50 [2018-10-27 09:03:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:36,252 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-10-27 09:03:36,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-27 09:03:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-10-27 09:03:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 09:03:36,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:36,253 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:36,253 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:36,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:36,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1410208890, now seen corresponding path program 6 times [2018-10-27 09:03:36,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:36,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:36,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:36,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:36,254 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:37,030 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-10-27 09:03:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:40,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:40,035 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:40,035 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:40,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:40,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:40,035 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:03:40,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:03:40,043 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:03:40,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:03:40,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:40,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:40,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:40,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:40,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-10-27 09:03:40,460 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:40,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 09:03:40,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 09:03:40,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2018-10-27 09:03:40,462 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 17 states. [2018-10-27 09:03:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:40,736 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-10-27 09:03:40,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 09:03:40,736 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-10-27 09:03:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:40,737 INFO L225 Difference]: With dead ends: 82 [2018-10-27 09:03:40,737 INFO L226 Difference]: Without dead ends: 69 [2018-10-27 09:03:40,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2018-10-27 09:03:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-27 09:03:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-10-27 09:03:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 09:03:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-10-27 09:03:40,747 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2018-10-27 09:03:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:40,747 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-10-27 09:03:40,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 09:03:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-10-27 09:03:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 09:03:40,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:40,748 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:40,748 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:40,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash 823402876, now seen corresponding path program 7 times [2018-10-27 09:03:40,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:40,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:40,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:41,038 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 28 [2018-10-27 09:03:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:42,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:42,409 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:42,410 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:42,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:42,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:42,410 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:03:42,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:42,417 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:03:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:42,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:42,579 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 09:03:42,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:42,606 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 09:03:42,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:42,607 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 09:03:42,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:50,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-10-27 09:03:50,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:03:50,741 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:50,860 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:50,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-10-27 09:03:50,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 09:03:50,878 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:50,890 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:50,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 09:03:50,924 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:445, output treesize:66 [2018-10-27 09:03:51,695 WARN L179 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-27 09:03:52,229 WARN L179 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 09:03:54,383 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 09:03:54,972 WARN L179 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-27 09:03:56,498 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-27 09:03:57,230 WARN L179 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 09:03:58,179 WARN L179 SmtUtils]: Spent 791.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 09:03:59,164 WARN L179 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-10-27 09:04:01,762 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-27 09:04:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:02,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:04:02,304 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2018-10-27 09:04:03,065 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-27 09:04:04,209 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-10-27 09:04:04,820 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 09:04:05,159 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 09:04:05,568 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-27 09:04:06,184 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 09:04:06,581 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 09:04:07,339 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-10-27 09:04:08,181 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-27 09:04:08,661 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-27 09:04:09,713 WARN L179 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-10-27 09:04:10,559 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 09:04:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:10,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:04:10,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 23] total 59 [2018-10-27 09:04:10,634 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:04:10,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-27 09:04:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-27 09:04:10,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=3136, Unknown=0, NotChecked=0, Total=3422 [2018-10-27 09:04:10,635 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 38 states. [2018-10-27 09:04:12,598 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-10-27 09:04:13,777 WARN L179 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-27 09:04:14,632 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-10-27 09:04:17,854 WARN L179 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2018-10-27 09:04:18,154 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-10-27 09:04:20,388 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-10-27 09:04:24,533 WARN L179 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-10-27 09:04:25,842 WARN L179 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-27 09:04:27,043 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-10-27 09:04:27,261 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2018-10-27 09:04:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:04:27,361 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-10-27 09:04:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 09:04:27,362 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 55 [2018-10-27 09:04:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:04:27,363 INFO L225 Difference]: With dead ends: 75 [2018-10-27 09:04:27,363 INFO L226 Difference]: Without dead ends: 65 [2018-10-27 09:04:27,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=490, Invalid=4622, Unknown=0, NotChecked=0, Total=5112 [2018-10-27 09:04:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-27 09:04:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-27 09:04:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 09:04:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-10-27 09:04:27,376 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 55 [2018-10-27 09:04:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:04:27,376 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-10-27 09:04:27,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-27 09:04:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-10-27 09:04:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 09:04:27,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:04:27,377 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:04:27,378 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:04:27,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash -62874888, now seen corresponding path program 7 times [2018-10-27 09:04:27,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:04:27,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:27,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:04:27,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:27,379 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:04:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 32 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:48,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:48,810 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:04:48,811 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:04:48,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:04:48,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:48,811 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 09:04:48,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:04:48,820 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:04:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:48,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:04:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 32 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:48,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:04:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 32 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:49,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:04:49,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2018-10-27 09:04:49,353 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:04:49,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 09:04:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 09:04:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=534, Unknown=8, NotChecked=0, Total=756 [2018-10-27 09:04:49,355 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 19 states. [2018-10-27 09:04:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:04:49,725 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-10-27 09:04:49,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 09:04:49,726 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-10-27 09:04:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:04:49,727 INFO L225 Difference]: With dead ends: 87 [2018-10-27 09:04:49,727 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 09:04:49,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=214, Invalid=534, Unknown=8, NotChecked=0, Total=756 [2018-10-27 09:04:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 09:04:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-10-27 09:04:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-27 09:04:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-10-27 09:04:49,738 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2018-10-27 09:04:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:04:49,738 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-10-27 09:04:49,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 09:04:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-10-27 09:04:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 09:04:49,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:04:49,739 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:04:49,739 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:04:49,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:49,740 INFO L82 PathProgramCache]: Analyzing trace with hash -649680902, now seen corresponding path program 8 times [2018-10-27 09:04:49,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:04:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:49,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:04:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:49,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:04:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:52,140 WARN L179 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 126 DAG size of output: 24 [2018-10-27 09:04:53,307 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2018-10-27 09:04:53,528 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2018-10-27 09:04:53,792 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2018-10-27 09:04:54,104 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 Received shutdown request... [2018-10-27 09:04:56,535 WARN L187 SmtUtils]: Removed 5 from assertion stack [2018-10-27 09:04:56,535 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 09:04:56,539 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 09:04:56,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 09:04:56 BoogieIcfgContainer [2018-10-27 09:04:56,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 09:04:56,540 INFO L168 Benchmark]: Toolchain (without parser) took 263282.07 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -996.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-27 09:04:56,541 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-10-27 09:04:56,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.02 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-10-27 09:04:56,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.68 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-10-27 09:04:56,542 INFO L168 Benchmark]: Boogie Preprocessor took 52.42 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-10-27 09:04:56,542 INFO L168 Benchmark]: RCFGBuilder took 635.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 789.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -827.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-10-27 09:04:56,543 INFO L168 Benchmark]: TraceAbstraction took 262218.31 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 226.0 MB). Free memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: -179.2 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2018-10-27 09:04:56,545 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 316.02 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 53.68 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 52.42 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 635.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 789.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -827.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 262218.31 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 226.0 MB). Free memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: -179.2 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 9,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. TIMEOUT Result, 262.1s OverallTime, 22 OverallIterations, 9 TraceHistogramMax, 51.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 549 SDslu, 3673 SDs, 0 SdLazy, 5800 SolverSat, 170 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1533 GetRequests, 950 SyntacticMatches, 45 SemanticMatches, 538 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5596 ImplicationChecksByTransitivity, 186.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 90 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 22.3s SatisfiabilityAnalysisTime, 179.4s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1936 ConstructedInterpolants, 226 QuantifiedInterpolants, 3062205 SizeOfPredicates, 193 NumberOfNonLiveVariables, 2759 ConjunctsInSsa, 586 ConjunctsInUnsatCore, 51 InterpolantComputations, 6 PerfectInterpolantSequences, 432/2876 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown