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/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:33:28,693 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:33:28,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:33:28,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:33:28,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:33:28,709 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:33:28,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:33:28,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:33:28,714 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:33:28,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:33:28,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:33:28,716 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:33:28,717 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:33:28,718 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:33:28,719 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:33:28,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:33:28,721 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:33:28,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:33:28,725 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:33:28,726 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:33:28,728 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:33:28,729 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:33:28,731 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:33:28,733 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:33:28,733 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:33:28,734 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:33:28,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:33:28,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:33:28,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:33:28,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:33:28,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:33:28,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:33:28,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:33:28,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:33:28,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:33:28,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:33:28,748 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-24 12:33:28,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:33:28,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:33:28,775 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:33:28,775 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:33:28,775 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:33:28,775 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:33:28,775 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:33:28,776 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:33:28,776 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:33:28,776 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:33:28,776 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:33:28,776 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:33:28,777 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:33:28,777 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:33:28,778 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:33:28,778 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:33:28,778 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:33:28,778 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:33:28,778 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:33:28,779 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:33:28,779 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:33:28,779 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:33:28,779 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:33:28,779 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:33:28,779 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:33:28,780 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:33:28,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:33:28,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:33:28,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:33:28,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:33:28,781 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:33:28,781 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:33:28,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:33:28,781 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:33:28,781 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:33:28,782 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:33:28,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:33:28,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:33:28,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:33:28,865 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:33:28,866 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:33:28,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-10-24 12:33:28,927 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c72f96ede/d8320aae26054d7eab3719b9658d012e/FLAGbd81fd2a3 [2018-10-24 12:33:29,414 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:33:29,414 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-10-24 12:33:29,422 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c72f96ede/d8320aae26054d7eab3719b9658d012e/FLAGbd81fd2a3 [2018-10-24 12:33:29,440 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c72f96ede/d8320aae26054d7eab3719b9658d012e [2018-10-24 12:33:29,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:33:29,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:33:29,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:33:29,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:33:29,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:33:29,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@662db0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29, skipping insertion in model container [2018-10-24 12:33:29,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:33:29,495 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:33:29,711 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:33:29,716 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:33:29,741 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:33:29,760 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:33:29,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29 WrapperNode [2018-10-24 12:33:29,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:33:29,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:33:29,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:33:29,762 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:33:29,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:33:29,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:33:29,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:33:29,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:33:29,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:33:29,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:33:29,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:33:29,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:33:29,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (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-24 12:33:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:33:29,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:33:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:33:29,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:33:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:33:29,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:33:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:33:29,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:33:30,348 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:33:30,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:33:30 BoogieIcfgContainer [2018-10-24 12:33:30,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:33:30,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:33:30,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:33:30,353 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:33:30,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:33:29" (1/3) ... [2018-10-24 12:33:30,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75900eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:33:30, skipping insertion in model container [2018-10-24 12:33:30,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (2/3) ... [2018-10-24 12:33:30,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75900eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:33:30, skipping insertion in model container [2018-10-24 12:33:30,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:33:30" (3/3) ... [2018-10-24 12:33:30,356 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call3_true-termination.i [2018-10-24 12:33:30,367 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:33:30,375 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:33:30,389 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:33:30,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:33:30,423 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:33:30,423 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:33:30,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:33:30,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:33:30,424 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:33:30,424 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:33:30,424 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:33:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-10-24 12:33:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 12:33:30,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:30,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:30,453 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:30,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash 974464032, now seen corresponding path program 1 times [2018-10-24 12:33:30,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:30,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:30,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:30,594 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-24 12:33:30,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:33:30,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:33:30,597 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:33:30,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:33:30,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:33:30,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:33:30,617 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-10-24 12:33:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:30,641 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-10-24 12:33:30,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:33:30,643 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-24 12:33:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:30,652 INFO L225 Difference]: With dead ends: 44 [2018-10-24 12:33:30,652 INFO L226 Difference]: Without dead ends: 21 [2018-10-24 12:33:30,656 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-24 12:33:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-24 12:33:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-24 12:33:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-24 12:33:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-24 12:33:30,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-10-24 12:33:30,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:30,702 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-24 12:33:30,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:33:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-24 12:33:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 12:33:30,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:30,703 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:30,705 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:30,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash 984975661, now seen corresponding path program 1 times [2018-10-24 12:33:30,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:30,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:30,832 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-24 12:33:30,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:33:30,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:33:30,834 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:33:30,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:33:30,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:33:30,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:33:30,839 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2018-10-24 12:33:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:30,933 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-10-24 12:33:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:33:30,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-24 12:33:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:30,936 INFO L225 Difference]: With dead ends: 42 [2018-10-24 12:33:30,936 INFO L226 Difference]: Without dead ends: 29 [2018-10-24 12:33:30,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:33:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-24 12:33:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-10-24 12:33:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-24 12:33:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-10-24 12:33:30,948 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2018-10-24 12:33:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:30,949 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-24 12:33:30,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:33:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-10-24 12:33:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 12:33:30,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:30,950 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:30,951 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:30,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1246878611, now seen corresponding path program 1 times [2018-10-24 12:33:30,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:31,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:31,110 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:31,111 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-10-24 12:33:31,113 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [15], [19], [23], [28], [33], [44], [47], [49], [55], [56], [57], [59] [2018-10-24 12:33:31,149 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:33:31,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:33:31,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:33:31,513 INFO L272 AbstractInterpreter]: Visited 17 different actions 34 times. Merged at 7 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-10-24 12:33:31,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:31,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:33:31,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:31,558 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-24 12:33:31,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:31,578 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:33:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:31,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:31,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:32,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:32,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-24 12:33:32,042 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:32,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:33:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:33:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:33:32,043 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 4 states. [2018-10-24 12:33:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:32,145 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-10-24 12:33:32,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:33:32,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-24 12:33:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:32,147 INFO L225 Difference]: With dead ends: 50 [2018-10-24 12:33:32,147 INFO L226 Difference]: Without dead ends: 37 [2018-10-24 12:33:32,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:33:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-24 12:33:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2018-10-24 12:33:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-24 12:33:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-24 12:33:32,154 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-10-24 12:33:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:32,155 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-24 12:33:32,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:33:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-24 12:33:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-24 12:33:32,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:32,156 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:32,157 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:32,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:32,157 INFO L82 PathProgramCache]: Analyzing trace with hash -467456903, now seen corresponding path program 2 times [2018-10-24 12:33:32,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:32,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:32,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:32,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:32,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:32,389 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:32,390 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:32,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:32,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:32,390 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-24 12:33:32,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:33:32,406 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:33:32,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:33:32,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:33:32,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:32,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:32,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:32,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-24 12:33:32,649 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:32,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:33:32,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:33:32,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 12:33:32,651 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-10-24 12:33:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:32,863 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-10-24 12:33:32,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:33:32,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-24 12:33:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:32,865 INFO L225 Difference]: With dead ends: 58 [2018-10-24 12:33:32,865 INFO L226 Difference]: Without dead ends: 45 [2018-10-24 12:33:32,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 12:33:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-24 12:33:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2018-10-24 12:33:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-24 12:33:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-24 12:33:32,872 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2018-10-24 12:33:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:32,873 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-24 12:33:32,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:33:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-24 12:33:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 12:33:32,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:32,874 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:32,874 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:32,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1323555807, now seen corresponding path program 3 times [2018-10-24 12:33:32,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:32,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:33:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:32,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:33,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:33,068 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:33,068 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:33,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:33,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:33,069 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-24 12:33:33,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:33:33,087 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:33:33,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:33:33,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:33:33,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:33,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:33,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:33,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-10-24 12:33:33,602 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:33,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:33:33,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:33:33,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:33:33,603 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-10-24 12:33:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:33,821 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-10-24 12:33:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:33:33,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-10-24 12:33:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:33,824 INFO L225 Difference]: With dead ends: 66 [2018-10-24 12:33:33,824 INFO L226 Difference]: Without dead ends: 53 [2018-10-24 12:33:33,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:33:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-24 12:33:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 29. [2018-10-24 12:33:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-24 12:33:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-24 12:33:33,832 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-10-24 12:33:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:33,832 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-24 12:33:33,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:33:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-24 12:33:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 12:33:33,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:33,833 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:33,834 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:33,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash 204884421, now seen corresponding path program 4 times [2018-10-24 12:33:33,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:33,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:33:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:33,836 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:34,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:34,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:34,014 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:34,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:34,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:34,014 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-24 12:33:34,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:34,024 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:33:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:34,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:34,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:34,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:34,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-10-24 12:33:34,295 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:34,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:33:34,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:33:34,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:33:34,296 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2018-10-24 12:33:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:34,521 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2018-10-24 12:33:34,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:33:34,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-24 12:33:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:34,524 INFO L225 Difference]: With dead ends: 74 [2018-10-24 12:33:34,524 INFO L226 Difference]: Without dead ends: 61 [2018-10-24 12:33:34,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:33:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-24 12:33:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2018-10-24 12:33:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-24 12:33:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-24 12:33:34,532 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2018-10-24 12:33:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:34,532 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-24 12:33:34,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:33:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-24 12:33:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-24 12:33:34,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:34,533 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:34,534 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:34,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1096493525, now seen corresponding path program 5 times [2018-10-24 12:33:34,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:34,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:34,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:34,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:34,826 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:34,826 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:34,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:34,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:34,827 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-24 12:33:34,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:33:34,842 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:33:35,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:33:35,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:33:35,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:35,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:35,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:35,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-10-24 12:33:35,205 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:35,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:33:35,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:33:35,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:33:35,206 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-10-24 12:33:35,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:35,521 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-10-24 12:33:35,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:33:35,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-24 12:33:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:35,524 INFO L225 Difference]: With dead ends: 82 [2018-10-24 12:33:35,524 INFO L226 Difference]: Without dead ends: 69 [2018-10-24 12:33:35,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:33:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-24 12:33:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 33. [2018-10-24 12:33:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-24 12:33:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-10-24 12:33:35,534 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2018-10-24 12:33:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:35,534 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-10-24 12:33:35,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:33:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-10-24 12:33:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 12:33:35,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:35,535 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:35,536 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:35,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:35,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1885216495, now seen corresponding path program 6 times [2018-10-24 12:33:35,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:35,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:35,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:33:35,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:35,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:36,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:36,215 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:36,215 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:36,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:36,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:36,216 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-24 12:33:36,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:33:36,225 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:33:36,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:33:36,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:33:36,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:36,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:36,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:36,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-10-24 12:33:36,525 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:36,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:33:36,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:33:36,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:33:36,526 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 9 states. [2018-10-24 12:33:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:36,854 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2018-10-24 12:33:36,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:33:36,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-24 12:33:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:36,856 INFO L225 Difference]: With dead ends: 90 [2018-10-24 12:33:36,857 INFO L226 Difference]: Without dead ends: 77 [2018-10-24 12:33:36,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:33:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-24 12:33:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 35. [2018-10-24 12:33:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-24 12:33:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-10-24 12:33:36,866 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2018-10-24 12:33:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:36,866 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-10-24 12:33:36,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:33:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-10-24 12:33:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 12:33:36,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:36,868 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:36,868 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:36,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:36,868 INFO L82 PathProgramCache]: Analyzing trace with hash 361220727, now seen corresponding path program 7 times [2018-10-24 12:33:36,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:36,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:36,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:33:36,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:36,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:37,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:37,391 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:37,391 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:37,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:37,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:37,392 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-24 12:33:37,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:37,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:33:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:37,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:37,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:37,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-10-24 12:33:37,680 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:37,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:33:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:33:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:33:37,682 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 10 states. [2018-10-24 12:33:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:38,091 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-10-24 12:33:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:33:38,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-10-24 12:33:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:38,096 INFO L225 Difference]: With dead ends: 98 [2018-10-24 12:33:38,096 INFO L226 Difference]: Without dead ends: 85 [2018-10-24 12:33:38,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:33:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-24 12:33:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 37. [2018-10-24 12:33:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-24 12:33:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-10-24 12:33:38,105 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2018-10-24 12:33:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:38,105 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-10-24 12:33:38,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:33:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-10-24 12:33:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-24 12:33:38,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:38,107 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:38,107 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:38,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1181158819, now seen corresponding path program 8 times [2018-10-24 12:33:38,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:38,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:38,109 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:38,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:38,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:38,721 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:38,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:38,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:38,721 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-24 12:33:38,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:33:38,732 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:33:42,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-24 12:33:42,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:33:42,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:42,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:42,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:42,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-10-24 12:33:42,649 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:42,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:33:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:33:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:33:42,650 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 11 states. [2018-10-24 12:33:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:43,158 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2018-10-24 12:33:43,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:33:43,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-10-24 12:33:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:43,160 INFO L225 Difference]: With dead ends: 106 [2018-10-24 12:33:43,161 INFO L226 Difference]: Without dead ends: 93 [2018-10-24 12:33:43,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:33:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-24 12:33:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 39. [2018-10-24 12:33:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-24 12:33:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-10-24 12:33:43,169 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 32 [2018-10-24 12:33:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:43,170 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-10-24 12:33:43,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:33:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-10-24 12:33:43,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-24 12:33:43,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:43,171 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:43,171 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:43,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1644185405, now seen corresponding path program 9 times [2018-10-24 12:33:43,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:43,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:43,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:33:43,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:43,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:43,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:43,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:43,635 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:43,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:43,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:43,636 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-24 12:33:43,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:33:43,661 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:33:43,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:33:43,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:33:43,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:43,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:44,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:44,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-10-24 12:33:44,157 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:44,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 12:33:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 12:33:44,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:33:44,160 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 12 states. [2018-10-24 12:33:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:44,702 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2018-10-24 12:33:44,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 12:33:44,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-10-24 12:33:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:44,704 INFO L225 Difference]: With dead ends: 114 [2018-10-24 12:33:44,704 INFO L226 Difference]: Without dead ends: 101 [2018-10-24 12:33:44,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:33:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-24 12:33:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2018-10-24 12:33:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-24 12:33:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-24 12:33:44,712 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2018-10-24 12:33:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:44,712 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-24 12:33:44,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 12:33:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-24 12:33:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 12:33:44,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:44,713 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:44,714 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:44,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:44,714 INFO L82 PathProgramCache]: Analyzing trace with hash 63864233, now seen corresponding path program 10 times [2018-10-24 12:33:44,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:44,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:44,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:33:44,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:44,715 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:45,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:45,453 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:45,453 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:45,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:45,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:45,454 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-24 12:33:45,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:45,461 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:33:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:45,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:45,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:46,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:46,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-10-24 12:33:46,148 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:46,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:33:46,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:33:46,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:33:46,150 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 13 states. [2018-10-24 12:33:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:47,191 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2018-10-24 12:33:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:33:47,195 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-10-24 12:33:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:47,196 INFO L225 Difference]: With dead ends: 122 [2018-10-24 12:33:47,196 INFO L226 Difference]: Without dead ends: 109 [2018-10-24 12:33:47,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:33:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-24 12:33:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 43. [2018-10-24 12:33:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-24 12:33:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-10-24 12:33:47,204 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 36 [2018-10-24 12:33:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:47,204 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-10-24 12:33:47,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:33:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-10-24 12:33:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-24 12:33:47,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:47,205 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:47,206 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:47,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash 822059279, now seen corresponding path program 11 times [2018-10-24 12:33:47,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:47,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:47,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:47,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:47,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:47,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:47,458 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:47,459 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:33:47,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:33:47,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:47,459 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-24 12:33:47,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:33:47,466 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:34:42,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-24 12:34:42,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:34:42,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:34:42,527 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 11 treesize of output 8 [2018-10-24 12:34:42,539 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 8 treesize of output 7 [2018-10-24 12:34:42,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:42,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:42,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:42,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-10-24 12:34:42,666 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 16 [2018-10-24 12:34:42,702 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:34:42,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-24 12:34:42,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:42,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:42,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:42,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-24 12:34:43,302 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 16 [2018-10-24 12:34:43,322 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:34:43,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-24 12:34:43,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-24 12:34:43,387 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 16 [2018-10-24 12:34:43,390 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:34:43,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-24 12:34:43,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-24 12:34:43,484 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 16 [2018-10-24 12:34:43,487 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:34:43,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-24 12:34:43,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-24 12:34:43,527 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 16 [2018-10-24 12:34:43,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:34:43,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-24 12:34:43,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-24 12:34:43,572 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 16 [2018-10-24 12:34:43,575 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:34:43,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-24 12:34:43,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-10-24 12:34:43,617 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 27 treesize of output 22 [2018-10-24 12:34:43,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2018-10-24 12:34:43,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:34:43,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:34:43,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:34:43,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2018-10-24 12:34:43,721 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 25 [2018-10-24 12:34:43,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-10-24 12:34:43,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:34:43,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:34:43,831 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 32 treesize of output 29 [2018-10-24 12:34:43,840 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 16 treesize of output 15 [2018-10-24 12:34:43,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:43,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:34:43,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:40 [2018-10-24 12:34:43,974 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-24 12:34:43,985 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 16 treesize of output 15 [2018-10-24 12:34:43,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,125 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 32 treesize of output 29 [2018-10-24 12:34:44,132 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 16 treesize of output 15 [2018-10-24 12:34:44,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,191 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 37 treesize of output 32 [2018-10-24 12:34:44,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-10-24 12:34:44,209 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-24 12:34:44,233 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:34:44,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:34:44,290 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:116, output treesize:60 [2018-10-24 12:34:44,402 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 39 [2018-10-24 12:34:44,411 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:34:44,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-10-24 12:34:44,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,529 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 32 treesize of output 29 [2018-10-24 12:34:44,545 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 16 treesize of output 15 [2018-10-24 12:34:44,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,638 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 32 treesize of output 29 [2018-10-24 12:34:44,642 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 16 treesize of output 15 [2018-10-24 12:34:44,642 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,728 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 32 treesize of output 29 [2018-10-24 12:34:44,732 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 16 treesize of output 15 [2018-10-24 12:34:44,732 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,740 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:44,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:34:44,818 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:162, output treesize:65 [2018-10-24 12:34:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:34:45,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:34:46,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 84 treesize of output 82 [2018-10-24 12:34:46,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 86 [2018-10-24 12:34:47,024 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 106 [2018-10-24 12:34:47,036 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,037 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,038 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 145 [2018-10-24 12:34:47,054 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,055 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,055 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,056 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,058 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,059 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 203 [2018-10-24 12:34:47,102 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,102 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,103 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,104 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,104 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,105 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,106 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,107 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 280 [2018-10-24 12:34:47,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,182 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,199 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,204 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,205 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,205 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,206 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,206 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,224 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,231 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,232 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,232 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,234 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,295 INFO L303 Elim1Store]: Index analysis took 150 ms [2018-10-24 12:34:47,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 376 [2018-10-24 12:34:47,778 WARN L179 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-10-24 12:34:47,807 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,808 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,808 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,809 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,810 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,810 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,813 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,814 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,815 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,816 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,819 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,819 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,820 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,822 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,829 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,846 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,871 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,872 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,873 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:47,946 INFO L303 Elim1Store]: Index analysis took 163 ms [2018-10-24 12:34:48,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 355 [2018-10-24 12:34:48,046 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-24 12:34:48,063 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:34:48,063 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:48,565 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:34:48,648 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:34:48,698 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:34:48,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:34:48,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:34:48,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:34:48,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:34:48,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:34:48,850 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:99, output treesize:91 [2018-10-24 12:34:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 18 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:34:49,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:34:49,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2018-10-24 12:34:49,024 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:34:49,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-24 12:34:49,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-24 12:34:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1395, Unknown=0, NotChecked=0, Total=1722 [2018-10-24 12:34:49,026 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 28 states. [2018-10-24 12:34:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:51,866 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2018-10-24 12:34:51,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:34:51,866 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2018-10-24 12:34:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:51,867 INFO L225 Difference]: With dead ends: 136 [2018-10-24 12:34:51,867 INFO L226 Difference]: Without dead ends: 123 [2018-10-24 12:34:51,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=450, Invalid=1806, Unknown=0, NotChecked=0, Total=2256 [2018-10-24 12:34:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-24 12:34:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 48. [2018-10-24 12:34:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-24 12:34:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-10-24 12:34:51,877 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 38 [2018-10-24 12:34:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:51,877 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-10-24 12:34:51,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-24 12:34:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-10-24 12:34:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 12:34:51,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:51,879 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:34:51,879 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:51,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -698788877, now seen corresponding path program 1 times [2018-10-24 12:34:51,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:51,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:34:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:51,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-24 12:34:52,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:34:52,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:34:52,020 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:34:52,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:34:52,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:34:52,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:34:52,021 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 5 states. [2018-10-24 12:34:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:52,172 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-10-24 12:34:52,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:34:52,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-10-24 12:34:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:52,174 INFO L225 Difference]: With dead ends: 56 [2018-10-24 12:34:52,174 INFO L226 Difference]: Without dead ends: 54 [2018-10-24 12:34:52,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:34:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-24 12:34:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-24 12:34:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-24 12:34:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-10-24 12:34:52,182 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 40 [2018-10-24 12:34:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:52,182 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-10-24 12:34:52,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:34:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-10-24 12:34:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-24 12:34:52,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:52,184 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:34:52,184 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:52,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2109295140, now seen corresponding path program 1 times [2018-10-24 12:34:52,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:52,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:52,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:52,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:52,185 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 156 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:34:52,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:52,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:34:52,531 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-10-24 12:34:52,531 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [15], [19], [23], [28], [31], [33], [36], [38], [44], [47], [49], [52], [54], [55], [56], [57], [59], [60] [2018-10-24 12:34:52,533 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:34:52,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:34:52,865 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:34:52,865 INFO L272 AbstractInterpreter]: Visited 23 different actions 87 times. Merged at 11 different actions 34 times. Widened at 1 different actions 2 times. Found 7 fixpoints after 3 different actions. Largest state had 32 variables. [2018-10-24 12:34:52,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:52,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:34:52,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:52,904 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-24 12:34:52,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:52,917 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:34:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:52,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:34:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:34:53,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:34:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 156 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:34:53,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:34:53,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-10-24 12:34:53,528 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:34:53,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:34:53,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:34:53,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-10-24 12:34:53,529 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 15 states. [2018-10-24 12:34:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:54,422 INFO L93 Difference]: Finished difference Result 163 states and 204 transitions. [2018-10-24 12:34:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 12:34:54,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-10-24 12:34:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:54,428 INFO L225 Difference]: With dead ends: 163 [2018-10-24 12:34:54,429 INFO L226 Difference]: Without dead ends: 142 [2018-10-24 12:34:54,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-10-24 12:34:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-24 12:34:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 55. [2018-10-24 12:34:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-24 12:34:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-10-24 12:34:54,443 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2018-10-24 12:34:54,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:54,443 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-10-24 12:34:54,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:34:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-10-24 12:34:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 12:34:54,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:54,444 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:34:54,444 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:54,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:54,445 INFO L82 PathProgramCache]: Analyzing trace with hash 236815114, now seen corresponding path program 2 times [2018-10-24 12:34:54,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:54,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:54,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:54,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:54,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 182 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:34:54,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:54,742 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:34:54,742 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:34:54,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:34:54,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:54,742 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-24 12:34:54,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:34:54,749 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:35:48,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-10-24 12:35:48,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:35:48,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:35:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:35:48,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:35:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 182 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:35:49,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:35:49,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-10-24 12:35:49,477 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:35:49,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:35:49,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:35:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-10-24 12:35:49,478 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 16 states. [2018-10-24 12:35:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:35:50,937 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2018-10-24 12:35:50,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 12:35:50,937 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-10-24 12:35:50,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:35:50,939 INFO L225 Difference]: With dead ends: 172 [2018-10-24 12:35:50,939 INFO L226 Difference]: Without dead ends: 151 [2018-10-24 12:35:50,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-10-24 12:35:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-24 12:35:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 57. [2018-10-24 12:35:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-24 12:35:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-10-24 12:35:50,954 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 52 [2018-10-24 12:35:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:35:50,954 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-10-24 12:35:50,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:35:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-10-24 12:35:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-24 12:35:50,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:35:50,955 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:35:50,956 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:35:50,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:35:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 374807152, now seen corresponding path program 3 times [2018-10-24 12:35:50,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:35:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:35:50,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:35:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:35:50,957 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:35:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:35:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 2 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:35:51,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:35:51,906 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:35:51,906 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:35:51,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:35:51,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:35:51,907 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-24 12:35:51,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:35:51,915 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:35:51,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:35:51,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:35:51,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:35:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:35:52,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:35:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 2 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:35:52,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:35:52,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-10-24 12:35:52,698 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:35:52,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-24 12:35:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-24 12:35:52,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-10-24 12:35:52,700 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 17 states. [2018-10-24 12:35:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:35:53,898 INFO L93 Difference]: Finished difference Result 181 states and 228 transitions. [2018-10-24 12:35:53,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 12:35:53,899 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-10-24 12:35:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:35:53,900 INFO L225 Difference]: With dead ends: 181 [2018-10-24 12:35:53,900 INFO L226 Difference]: Without dead ends: 160 [2018-10-24 12:35:53,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-10-24 12:35:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-24 12:35:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 59. [2018-10-24 12:35:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-24 12:35:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-10-24 12:35:53,914 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 54 [2018-10-24 12:35:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:35:53,914 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-10-24 12:35:53,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-24 12:35:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-10-24 12:35:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-24 12:35:53,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:35:53,916 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:35:53,916 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:35:53,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:35:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash -158830506, now seen corresponding path program 4 times [2018-10-24 12:35:53,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:35:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:35:53,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:35:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:35:53,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:35:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:35:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 2 proven. 240 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:35:54,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:35:54,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:35:54,296 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:35:54,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:35:54,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:35:54,296 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-24 12:35:54,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:35:54,304 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:35:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:35:54,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:35:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:35:54,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:35:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 2 proven. 240 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:35:55,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:35:55,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-10-24 12:35:55,060 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:35:55,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 12:35:55,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 12:35:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:35:55,061 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 18 states. [2018-10-24 12:35:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:35:56,138 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2018-10-24 12:35:56,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:35:56,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-10-24 12:35:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:35:56,141 INFO L225 Difference]: With dead ends: 190 [2018-10-24 12:35:56,141 INFO L226 Difference]: Without dead ends: 169 [2018-10-24 12:35:56,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:35:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-24 12:35:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 61. [2018-10-24 12:35:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-24 12:35:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-10-24 12:35:56,155 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 56 [2018-10-24 12:35:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:35:56,156 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-10-24 12:35:56,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 12:35:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-10-24 12:35:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-24 12:35:56,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:35:56,157 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:35:56,157 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:35:56,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:35:56,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1883511620, now seen corresponding path program 5 times [2018-10-24 12:35:56,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:35:56,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:35:56,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:35:56,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:35:56,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:35:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:35:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 2 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:35:57,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:35:57,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:35:57,088 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:35:57,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:35:57,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:35:57,088 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:35:57,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:35:57,098 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:37:40,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-10-24 12:37:40,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:37:40,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:37:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:37:41,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:37:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 2 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:43,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:37:43,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-10-24 12:37:43,242 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:37:43,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:37:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:37:43,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:37:43,243 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 19 states. [2018-10-24 12:37:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:44,559 INFO L93 Difference]: Finished difference Result 199 states and 252 transitions. [2018-10-24 12:37:44,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 12:37:44,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-10-24 12:37:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:44,561 INFO L225 Difference]: With dead ends: 199 [2018-10-24 12:37:44,561 INFO L226 Difference]: Without dead ends: 178 [2018-10-24 12:37:44,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:37:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-24 12:37:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 63. [2018-10-24 12:37:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-24 12:37:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-10-24 12:37:44,578 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2018-10-24 12:37:44,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:44,578 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-10-24 12:37:44,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:37:44,578 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-10-24 12:37:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 12:37:44,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:44,579 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:44,579 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:44,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:44,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1444685918, now seen corresponding path program 6 times [2018-10-24 12:37:44,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:44,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:44,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:37:44,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:44,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 2 proven. 306 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:44,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:44,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:37:44,928 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:37:44,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:37:44,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:44,928 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:37:44,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:37:44,937 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:37:44,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:37:44,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:37:44,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:37:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:37:45,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:37:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 2 proven. 306 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:46,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:37:46,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-10-24 12:37:46,404 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:37:46,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-24 12:37:46,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-24 12:37:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-10-24 12:37:46,406 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 20 states. [2018-10-24 12:37:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:47,715 INFO L93 Difference]: Finished difference Result 208 states and 264 transitions. [2018-10-24 12:37:47,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 12:37:47,715 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-10-24 12:37:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:47,717 INFO L225 Difference]: With dead ends: 208 [2018-10-24 12:37:47,717 INFO L226 Difference]: Without dead ends: 187 [2018-10-24 12:37:47,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-10-24 12:37:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-24 12:37:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 65. [2018-10-24 12:37:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-24 12:37:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-10-24 12:37:47,735 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 60 [2018-10-24 12:37:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:47,735 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-10-24 12:37:47,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-24 12:37:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-10-24 12:37:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-24 12:37:47,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:47,736 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:47,737 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:47,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash -639981304, now seen corresponding path program 7 times [2018-10-24 12:37:47,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:47,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:37:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:47,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 2 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:48,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:48,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:37:48,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:37:48,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:37:48,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:48,163 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:37:48,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:48,171 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:37:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:48,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:37:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:37:48,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:37:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 2 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:49,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:37:49,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-10-24 12:37:49,449 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:37:49,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 12:37:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 12:37:49,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-10-24 12:37:49,450 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 21 states. [2018-10-24 12:37:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:51,072 INFO L93 Difference]: Finished difference Result 217 states and 276 transitions. [2018-10-24 12:37:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 12:37:51,077 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-10-24 12:37:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:51,079 INFO L225 Difference]: With dead ends: 217 [2018-10-24 12:37:51,079 INFO L226 Difference]: Without dead ends: 196 [2018-10-24 12:37:51,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-10-24 12:37:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-24 12:37:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 67. [2018-10-24 12:37:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-24 12:37:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-10-24 12:37:51,098 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 62 [2018-10-24 12:37:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:51,098 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-10-24 12:37:51,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 12:37:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-10-24 12:37:51,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 12:37:51,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:51,099 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:51,099 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:51,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash -412960530, now seen corresponding path program 8 times [2018-10-24 12:37:51,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:51,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:51,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:51,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:51,101 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 2 proven. 380 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:37:51,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:51,488 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:37:51,489 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:37:51,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:37:51,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:51,489 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:37:51,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:37:51,496 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown