java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:34:55,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:34:55,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:34:55,992 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:34:55,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:34:55,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:34:55,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:34:55,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:34:55,998 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:34:55,999 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:34:56,000 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:34:56,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:34:56,001 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:34:56,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:34:56,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:34:56,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:34:56,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:34:56,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:34:56,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:34:56,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:34:56,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:34:56,020 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:34:56,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:34:56,026 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:34:56,026 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:34:56,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:34:56,028 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:34:56,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:34:56,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:34:56,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:34:56,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:34:56,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:34:56,032 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:34:56,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:34:56,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:34:56,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:34:56,038 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:34:56,063 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:34:56,063 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:34:56,064 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:34:56,064 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:34:56,065 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:34:56,065 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:34:56,065 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:34:56,065 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:34:56,065 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:34:56,066 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:34:56,069 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:34:56,069 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:34:56,069 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:34:56,070 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:34:56,070 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:34:56,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:34:56,070 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:34:56,071 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:34:56,071 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:34:56,071 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:34:56,071 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:34:56,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:34:56,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:34:56,073 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:34:56,073 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:34:56,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:34:56,073 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:34:56,073 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:34:56,074 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:34:56,074 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:34:56,074 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:34:56,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:34:56,074 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:34:56,075 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:34:56,075 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:34:56,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:34:56,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:34:56,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:34:56,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:34:56,147 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:34:56,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-12 20:34:56,220 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4d0e3e2/fa92ef549873467e98b0c641afff1cd3/FLAG735c8f07d [2018-11-12 20:34:56,690 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:34:56,690 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-12 20:34:56,696 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4d0e3e2/fa92ef549873467e98b0c641afff1cd3/FLAG735c8f07d [2018-11-12 20:34:56,711 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4d0e3e2/fa92ef549873467e98b0c641afff1cd3 [2018-11-12 20:34:56,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:34:56,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:34:56,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:34:56,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:34:56,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:34:56,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:34:56" (1/1) ... [2018-11-12 20:34:56,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2d08f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:56, skipping insertion in model container [2018-11-12 20:34:56,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:34:56" (1/1) ... [2018-11-12 20:34:56,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:34:56,764 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:34:56,997 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:34:57,004 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:34:57,028 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:34:57,049 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:34:57,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57 WrapperNode [2018-11-12 20:34:57,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:34:57,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:34:57,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:34:57,051 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:34:57,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... [2018-11-12 20:34:57,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... [2018-11-12 20:34:57,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:34:57,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:34:57,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:34:57,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:34:57,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... [2018-11-12 20:34:57,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... [2018-11-12 20:34:57,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... [2018-11-12 20:34:57,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... [2018-11-12 20:34:57,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... [2018-11-12 20:34:57,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... [2018-11-12 20:34:57,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... [2018-11-12 20:34:57,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:34:57,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:34:57,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:34:57,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:34:57,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:34:57,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:34:57,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:34:57,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:34:57,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:34:57,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:34:57,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:34:57,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:34:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:34:57,505 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:34:57,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:34:57 BoogieIcfgContainer [2018-11-12 20:34:57,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:34:57,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:34:57,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:34:57,510 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:34:57,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:34:56" (1/3) ... [2018-11-12 20:34:57,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13770d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:34:57, skipping insertion in model container [2018-11-12 20:34:57,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:57" (2/3) ... [2018-11-12 20:34:57,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13770d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:34:57, skipping insertion in model container [2018-11-12 20:34:57,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:34:57" (3/3) ... [2018-11-12 20:34:57,514 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call1_true-termination.i [2018-11-12 20:34:57,524 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:34:57,533 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:34:57,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:34:57,587 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:34:57,588 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:34:57,588 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:34:57,588 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:34:57,588 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:34:57,588 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:34:57,589 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:34:57,589 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:34:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-12 20:34:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:34:57,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:57,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:57,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:57,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:57,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-12 20:34:57,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:57,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:57,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:57,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:57,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:57,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:34:57,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:34:57,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:34:57,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:34:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:34:57,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:34:57,762 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-12 20:34:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:57,786 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-12 20:34:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:34:57,787 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:34:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:57,796 INFO L225 Difference]: With dead ends: 30 [2018-11-12 20:34:57,796 INFO L226 Difference]: Without dead ends: 13 [2018-11-12 20:34:57,800 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:34:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-12 20:34:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-12 20:34:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-12 20:34:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-12 20:34:57,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-12 20:34:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:57,835 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-12 20:34:57,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:34:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-12 20:34:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:34:57,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:57,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:57,837 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:57,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:57,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-12 20:34:57,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:57,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:57,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:57,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:57,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:58,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:34:58,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:34:58,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:34:58,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:34:58,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:34:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:34:58,031 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-12 20:34:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:58,137 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-12 20:34:58,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:34:58,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:34:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:58,141 INFO L225 Difference]: With dead ends: 21 [2018-11-12 20:34:58,141 INFO L226 Difference]: Without dead ends: 16 [2018-11-12 20:34:58,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:34:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-12 20:34:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-12 20:34:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-12 20:34:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-12 20:34:58,149 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-12 20:34:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:58,149 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-12 20:34:58,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:34:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-12 20:34:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:34:58,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:58,151 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:58,152 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:58,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-12 20:34:58,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:58,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:58,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:58,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:58,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:58,280 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-12 20:34:58,282 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:34:58,318 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:34:58,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:34:58,417 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:34:58,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:34:58,764 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 26 times. Widened at 1 different actions 3 times. Performed 146 root evaluator evaluations with a maximum evaluation depth of 6. Performed 146 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-12 20:34:58,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:58,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:34:58,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:58,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:58,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:58,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:58,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:58,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:59,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:59,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-12 20:34:59,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:59,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:34:59,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:34:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:34:59,319 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2018-11-12 20:34:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:59,476 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-12 20:34:59,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:34:59,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-12 20:34:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:59,478 INFO L225 Difference]: With dead ends: 24 [2018-11-12 20:34:59,479 INFO L226 Difference]: Without dead ends: 19 [2018-11-12 20:34:59,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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-11-12 20:34:59,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-12 20:34:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-12 20:34:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:34:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-12 20:34:59,484 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-11-12 20:34:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:59,485 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-12 20:34:59,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:34:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-12 20:34:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:34:59,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:59,486 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:59,487 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:59,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:59,487 INFO L82 PathProgramCache]: Analyzing trace with hash -281914435, now seen corresponding path program 1 times [2018-11-12 20:34:59,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:59,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:59,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:59,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:59,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:59,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:59,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:59,651 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-12 20:34:59,652 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:34:59,653 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:34:59,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:34:59,658 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:34:59,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:34:59,886 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 26 times. Widened at 1 different actions 3 times. Performed 146 root evaluator evaluations with a maximum evaluation depth of 6. Performed 146 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-12 20:34:59,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:59,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:34:59,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:59,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:59,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:59,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:59,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:00,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:00,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:00,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-12 20:35:00,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:00,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:35:00,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:35:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:35:00,345 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2018-11-12 20:35:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:00,614 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-12 20:35:00,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:35:00,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-12 20:35:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:00,617 INFO L225 Difference]: With dead ends: 26 [2018-11-12 20:35:00,617 INFO L226 Difference]: Without dead ends: 21 [2018-11-12 20:35:00,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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-11-12 20:35:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-12 20:35:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-11-12 20:35:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:35:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-12 20:35:00,625 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-11-12 20:35:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:00,626 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-12 20:35:00,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:35:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-12 20:35:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:35:00,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:00,627 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:00,628 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:00,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:00,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-12 20:35:00,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:00,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:00,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:00,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:00,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:01,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:01,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:01,043 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:01,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:01,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:01,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:01,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:01,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:01,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:35:01,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:01,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:01,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:01,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:01,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-12 20:35:01,269 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:01,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:35:01,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:35:01,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:35:01,271 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2018-11-12 20:35:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:01,401 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-12 20:35:01,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:35:01,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-12 20:35:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:01,402 INFO L225 Difference]: With dead ends: 29 [2018-11-12 20:35:01,403 INFO L226 Difference]: Without dead ends: 24 [2018-11-12 20:35:01,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:35:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-12 20:35:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-12 20:35:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-12 20:35:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-12 20:35:01,409 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2018-11-12 20:35:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:01,409 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-12 20:35:01,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:35:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-12 20:35:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:35:01,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:01,411 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:01,411 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:01,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:01,411 INFO L82 PathProgramCache]: Analyzing trace with hash -849134272, now seen corresponding path program 1 times [2018-11-12 20:35:01,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:01,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:01,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:01,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:01,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:01,588 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-12 20:35:01,588 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:35:01,590 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:35:01,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:35:01,595 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:35:01,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:35:01,769 INFO L272 AbstractInterpreter]: Visited 14 different actions 69 times. Merged at 5 different actions 26 times. Widened at 1 different actions 3 times. Performed 197 root evaluator evaluations with a maximum evaluation depth of 6. Performed 197 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 2 different actions. Largest state had 4 variables. [2018-11-12 20:35:01,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:01,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:35:01,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:01,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:01,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:01,826 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:01,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:02,130 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 5 [2018-11-12 20:35:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:02,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:02,366 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:35:02,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-11-12 20:35:02,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:35:02,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:35:02,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:35:02,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:35:02,368 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2018-11-12 20:35:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:02,389 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-12 20:35:02,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:35:02,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-12 20:35:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:02,393 INFO L225 Difference]: With dead ends: 35 [2018-11-12 20:35:02,393 INFO L226 Difference]: Without dead ends: 27 [2018-11-12 20:35:02,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:35:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-12 20:35:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-12 20:35:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-12 20:35:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-12 20:35:02,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2018-11-12 20:35:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:02,401 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-12 20:35:02,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:35:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-12 20:35:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:35:02,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:02,402 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:02,403 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:02,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1277798652, now seen corresponding path program 2 times [2018-11-12 20:35:02,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:02,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:02,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:02,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:02,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:02,498 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:02,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:02,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:02,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:02,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:02,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:02,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:35:02,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:02,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:02,816 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 6 [2018-11-12 20:35:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:02,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:03,053 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:35:03,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-11-12 20:35:03,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:35:03,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:35:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:35:03,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:35:03,056 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-11-12 20:35:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:03,083 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-12 20:35:03,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:35:03,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-12 20:35:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:03,086 INFO L225 Difference]: With dead ends: 35 [2018-11-12 20:35:03,086 INFO L226 Difference]: Without dead ends: 27 [2018-11-12 20:35:03,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:35:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-12 20:35:03,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-12 20:35:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-12 20:35:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-12 20:35:03,092 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2018-11-12 20:35:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:03,093 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-12 20:35:03,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:35:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-12 20:35:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:35:03,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:03,094 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:03,094 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:03,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:03,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1242161282, now seen corresponding path program 2 times [2018-11-12 20:35:03,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:03,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:03,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:03,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:03,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:03,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:03,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:03,201 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:03,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:03,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:03,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:03,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:03,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:15,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:35:15,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:15,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:15,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:15,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:15,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-12 20:35:15,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:15,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:35:15,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:35:15,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:35:15,384 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-12 20:35:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:15,434 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-12 20:35:15,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:35:15,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-12 20:35:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:15,437 INFO L225 Difference]: With dead ends: 35 [2018-11-12 20:35:15,437 INFO L226 Difference]: Without dead ends: 30 [2018-11-12 20:35:15,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:35:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-12 20:35:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-12 20:35:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-12 20:35:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-12 20:35:15,443 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2018-11-12 20:35:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:15,443 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-12 20:35:15,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:35:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-12 20:35:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:35:15,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:15,444 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:15,445 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:15,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:15,445 INFO L82 PathProgramCache]: Analyzing trace with hash 26004059, now seen corresponding path program 3 times [2018-11-12 20:35:15,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:15,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:15,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:15,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:15,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:15,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:15,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:15,601 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:15,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:15,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:15,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:15,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:15,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:15,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:15,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:15,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:15,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:15,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:15,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-12 20:35:15,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:15,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:35:15,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:35:15,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:35:15,839 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 6 states. [2018-11-12 20:35:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:15,951 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-12 20:35:15,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:35:15,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-12 20:35:15,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:15,956 INFO L225 Difference]: With dead ends: 38 [2018-11-12 20:35:15,956 INFO L226 Difference]: Without dead ends: 33 [2018-11-12 20:35:15,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:35:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-12 20:35:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-12 20:35:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-12 20:35:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-12 20:35:15,962 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2018-11-12 20:35:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:15,963 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-12 20:35:15,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:35:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-12 20:35:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:35:15,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:15,964 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:15,964 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:15,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash 821178397, now seen corresponding path program 3 times [2018-11-12 20:35:15,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:15,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:15,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:15,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:15,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:16,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:16,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:16,078 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:16,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:16,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:16,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:16,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:16,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:16,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:16,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:16,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:16,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:16,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-12 20:35:16,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:16,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:35:16,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:35:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:35:16,268 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 6 states. [2018-11-12 20:35:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:16,332 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-12 20:35:16,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:35:16,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-12 20:35:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:16,335 INFO L225 Difference]: With dead ends: 41 [2018-11-12 20:35:16,335 INFO L226 Difference]: Without dead ends: 36 [2018-11-12 20:35:16,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:35:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-12 20:35:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-12 20:35:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-12 20:35:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-12 20:35:16,341 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 20 [2018-11-12 20:35:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:16,342 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-12 20:35:16,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:35:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-12 20:35:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:35:16,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:16,343 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:16,343 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:16,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash 427509150, now seen corresponding path program 4 times [2018-11-12 20:35:16,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:16,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:16,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:16,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:16,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:16,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:16,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:16,506 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:16,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:16,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:16,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:16,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:16,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:16,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:16,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:16,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:16,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-12 20:35:16,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:16,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:35:16,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:35:16,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:35:16,818 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 7 states. [2018-11-12 20:35:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:16,901 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-12 20:35:16,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:35:16,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-12 20:35:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:16,904 INFO L225 Difference]: With dead ends: 44 [2018-11-12 20:35:16,904 INFO L226 Difference]: Without dead ends: 39 [2018-11-12 20:35:16,905 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:35:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-12 20:35:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-12 20:35:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-12 20:35:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-12 20:35:16,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 23 [2018-11-12 20:35:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:16,913 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-12 20:35:16,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:35:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-12 20:35:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:35:16,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:16,914 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:16,914 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:16,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:16,914 INFO L82 PathProgramCache]: Analyzing trace with hash 201615134, now seen corresponding path program 4 times [2018-11-12 20:35:16,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:16,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:16,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:16,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:16,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:17,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:17,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:17,060 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:17,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:17,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:17,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:17,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:17,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:17,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:17,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:17,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:17,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-12 20:35:17,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:17,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:35:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:35:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:35:17,283 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 7 states. [2018-11-12 20:35:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:17,365 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-12 20:35:17,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:35:17,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-12 20:35:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:17,366 INFO L225 Difference]: With dead ends: 47 [2018-11-12 20:35:17,367 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:35:17,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 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-11-12 20:35:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:35:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-12 20:35:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-12 20:35:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-12 20:35:17,373 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 23 [2018-11-12 20:35:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:17,373 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-12 20:35:17,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:35:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-12 20:35:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-12 20:35:17,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:17,376 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:17,377 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:17,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash 181755771, now seen corresponding path program 5 times [2018-11-12 20:35:17,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:17,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:17,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:17,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:17,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:17,581 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:17,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:17,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:17,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:17,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:17,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:17,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:35:17,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:17,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:17,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:18,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:18,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-12 20:35:18,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:18,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:35:18,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:35:18,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:35:18,059 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 8 states. [2018-11-12 20:35:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:18,161 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-12 20:35:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:35:18,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-12 20:35:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:18,163 INFO L225 Difference]: With dead ends: 50 [2018-11-12 20:35:18,163 INFO L226 Difference]: Without dead ends: 45 [2018-11-12 20:35:18,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:35:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-12 20:35:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-12 20:35:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-12 20:35:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-12 20:35:18,170 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2018-11-12 20:35:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:18,170 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-12 20:35:18,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:35:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-12 20:35:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-12 20:35:18,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:18,172 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:18,172 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:18,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1733081987, now seen corresponding path program 5 times [2018-11-12 20:35:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:18,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:18,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:18,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:18,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:18,396 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:18,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:18,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:18,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:18,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:18,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:30,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:35:30,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:30,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:35:30,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:35:35,395 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:35:35,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 18 [2018-11-12 20:35:35,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:35:35,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:35:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:35:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=246, Unknown=2, NotChecked=0, Total=306 [2018-11-12 20:35:35,397 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 7 states. [2018-11-12 20:35:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:35,542 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-12 20:35:35,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:35:35,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-12 20:35:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:35,547 INFO L225 Difference]: With dead ends: 49 [2018-11-12 20:35:35,547 INFO L226 Difference]: Without dead ends: 30 [2018-11-12 20:35:35,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=70, Invalid=308, Unknown=2, NotChecked=0, Total=380 [2018-11-12 20:35:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-12 20:35:35,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-12 20:35:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-12 20:35:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-12 20:35:35,552 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-11-12 20:35:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:35,553 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-12 20:35:35,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:35:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-12 20:35:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:35:35,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:35,554 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:35,554 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:35,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1862081662, now seen corresponding path program 6 times [2018-11-12 20:35:35,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:35,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:35,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:35,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:35,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:35,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:35,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:35,821 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:35,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:35,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:35,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:35,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:35,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:35,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:35,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:35,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:35,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:36,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-12 20:35:36,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:36,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:35:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:35:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:35:36,719 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2018-11-12 20:35:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:36,880 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-12 20:35:36,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:35:36,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-12 20:35:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:36,882 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:35:36,882 INFO L226 Difference]: Without dead ends: 34 [2018-11-12 20:35:36,883 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:35:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-12 20:35:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-12 20:35:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-12 20:35:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-12 20:35:36,888 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-11-12 20:35:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:36,888 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-12 20:35:36,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:35:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-12 20:35:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-12 20:35:36,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:36,890 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:36,890 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:36,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1688101733, now seen corresponding path program 7 times [2018-11-12 20:35:36,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:36,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:36,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:37,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:37,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:37,158 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:37,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:37,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:37,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:37,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:37,168 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:37,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:37,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:37,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:37,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-12 20:35:37,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:37,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:35:37,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:35:37,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:35:37,664 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2018-11-12 20:35:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:37,895 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-12 20:35:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:35:37,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-12 20:35:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:37,896 INFO L225 Difference]: With dead ends: 42 [2018-11-12 20:35:37,897 INFO L226 Difference]: Without dead ends: 37 [2018-11-12 20:35:37,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:35:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-12 20:35:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-12 20:35:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:35:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-12 20:35:37,904 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-11-12 20:35:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:37,905 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-12 20:35:37,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:35:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-12 20:35:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:35:37,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:37,905 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:37,908 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:37,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1631958178, now seen corresponding path program 8 times [2018-11-12 20:35:37,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:37,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:37,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:38,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:38,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:38,051 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:38,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:38,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:38,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:38,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:38,060 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:38,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:35:38,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:38,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:38,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:39,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:39,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-12 20:35:39,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:39,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:35:39,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:35:39,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:35:39,035 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-11-12 20:35:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:39,221 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-12 20:35:39,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:35:39,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-12 20:35:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:39,223 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:35:39,223 INFO L226 Difference]: Without dead ends: 40 [2018-11-12 20:35:39,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 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-11-12 20:35:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-12 20:35:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-12 20:35:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-12 20:35:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-12 20:35:39,228 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-11-12 20:35:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:39,228 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-12 20:35:39,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:35:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-12 20:35:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-12 20:35:39,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:39,230 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:39,230 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:39,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:39,230 INFO L82 PathProgramCache]: Analyzing trace with hash 198410683, now seen corresponding path program 9 times [2018-11-12 20:35:39,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:39,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:39,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:39,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:39,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:39,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:39,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:39,480 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:39,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:39,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:39,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:39,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:39,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:39,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:39,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:39,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:39,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:40,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:40,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-12 20:35:40,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:40,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:35:40,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:35:40,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:35:40,322 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2018-11-12 20:35:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:40,543 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-12 20:35:40,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:35:40,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-12 20:35:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:40,545 INFO L225 Difference]: With dead ends: 48 [2018-11-12 20:35:40,545 INFO L226 Difference]: Without dead ends: 43 [2018-11-12 20:35:40,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:35:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-12 20:35:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-12 20:35:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-12 20:35:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-12 20:35:40,551 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-11-12 20:35:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:40,551 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-12 20:35:40,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:35:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-12 20:35:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:35:40,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:40,553 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:40,553 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:40,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash -187641282, now seen corresponding path program 10 times [2018-11-12 20:35:40,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:40,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:40,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:40,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:40,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:40,830 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:40,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:40,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:40,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:40,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:40,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:40,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:40,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:41,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:41,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-12 20:35:41,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:41,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:35:41,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:35:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:35:41,922 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2018-11-12 20:35:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:42,170 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-12 20:35:42,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:35:42,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-12 20:35:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:42,172 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:35:42,172 INFO L226 Difference]: Without dead ends: 46 [2018-11-12 20:35:42,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 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-11-12 20:35:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-12 20:35:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-12 20:35:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-12 20:35:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-12 20:35:42,176 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-11-12 20:35:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:42,177 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-12 20:35:42,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:35:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-12 20:35:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-12 20:35:42,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:42,178 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:42,178 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:42,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:42,178 INFO L82 PathProgramCache]: Analyzing trace with hash 860688091, now seen corresponding path program 11 times [2018-11-12 20:35:42,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:42,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:42,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:42,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:42,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:42,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:42,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:42,901 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:42,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:42,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:42,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:42,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:42,911 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:43,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:35:43,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:43,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:43,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:44,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:44,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-12 20:35:44,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:44,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:35:44,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:35:44,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:35:44,883 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 14 states. [2018-11-12 20:35:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:45,181 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-12 20:35:45,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:35:45,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-12 20:35:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:45,183 INFO L225 Difference]: With dead ends: 54 [2018-11-12 20:35:45,183 INFO L226 Difference]: Without dead ends: 49 [2018-11-12 20:35:45,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:35:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-12 20:35:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-12 20:35:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-12 20:35:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-12 20:35:45,189 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-11-12 20:35:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:45,189 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-12 20:35:45,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:35:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-12 20:35:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:35:45,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:45,190 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:45,191 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:45,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:45,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1361137378, now seen corresponding path program 12 times [2018-11-12 20:35:45,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:45,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:45,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:45,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:45,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:46,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:46,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:46,520 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:46,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:46,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:46,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:46,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:46,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:46,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:46,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:46,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:46,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:48,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:48,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-12 20:35:48,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:48,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:35:48,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:35:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:35:48,139 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 15 states. [2018-11-12 20:35:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:48,440 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-12 20:35:48,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:35:48,440 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-11-12 20:35:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:48,441 INFO L225 Difference]: With dead ends: 57 [2018-11-12 20:35:48,441 INFO L226 Difference]: Without dead ends: 52 [2018-11-12 20:35:48,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:35:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-12 20:35:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-12 20:35:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-12 20:35:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-12 20:35:48,447 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-11-12 20:35:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:48,447 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-12 20:35:48,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:35:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-12 20:35:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-12 20:35:48,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:48,449 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:48,449 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:48,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2022685701, now seen corresponding path program 13 times [2018-11-12 20:35:48,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:48,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:48,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:48,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:48,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:48,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:48,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:48,820 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:48,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:48,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:48,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:48,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:48,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:48,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:48,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:50,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-12 20:35:50,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:50,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:35:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:35:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:35:50,601 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2018-11-12 20:35:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:50,982 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-12 20:35:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:35:50,984 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-12 20:35:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:50,986 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:35:50,986 INFO L226 Difference]: Without dead ends: 55 [2018-11-12 20:35:50,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:35:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-12 20:35:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-12 20:35:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-12 20:35:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-12 20:35:50,990 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-11-12 20:35:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:50,990 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-12 20:35:50,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:35:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-12 20:35:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-12 20:35:50,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:50,991 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:50,991 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:50,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash -603854850, now seen corresponding path program 14 times [2018-11-12 20:35:50,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:50,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:50,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:51,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:51,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:51,324 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:51,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:51,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:51,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:51,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:51,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:36:17,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-12 20:36:17,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:17,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:17,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:26,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:26,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 33 [2018-11-12 20:36:26,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:26,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:36:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:36:26,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=751, Unknown=1, NotChecked=0, Total=1056 [2018-11-12 20:36:26,071 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 17 states. [2018-11-12 20:36:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:26,665 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-12 20:36:26,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:36:26,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-12 20:36:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:26,669 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:36:26,669 INFO L226 Difference]: Without dead ends: 58 [2018-11-12 20:36:26,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=304, Invalid=751, Unknown=1, NotChecked=0, Total=1056 [2018-11-12 20:36:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-12 20:36:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-12 20:36:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-12 20:36:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-12 20:36:26,674 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-11-12 20:36:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:26,675 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-12 20:36:26,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:36:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-12 20:36:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-12 20:36:26,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:26,676 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:26,676 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:26,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1012867355, now seen corresponding path program 15 times [2018-11-12 20:36:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:26,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:26,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:27,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:27,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:27,477 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:27,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:36:27,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:27,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:36:27,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:36:27,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:36:27,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:36:27,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:27,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:27,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:29,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:29,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-12 20:36:29,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:29,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:36:29,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:36:29,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:36:29,184 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 18 states. [2018-11-12 20:36:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:29,691 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-12 20:36:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:36:29,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-12 20:36:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:29,692 INFO L225 Difference]: With dead ends: 66 [2018-11-12 20:36:29,692 INFO L226 Difference]: Without dead ends: 61 [2018-11-12 20:36:29,692 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:36:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-12 20:36:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-12 20:36:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:36:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-12 20:36:29,696 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-11-12 20:36:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:29,696 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-12 20:36:29,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:36:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-12 20:36:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:36:29,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:29,697 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:29,697 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:29,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:29,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1020819166, now seen corresponding path program 16 times [2018-11-12 20:36:29,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:29,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:29,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:29,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:29,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:30,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:30,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:30,100 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:30,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:36:30,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:30,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:36:30,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:30,110 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:36:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:30,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:30,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:32,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:32,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-12 20:36:32,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:32,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:36:32,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:36:32,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:36:32,453 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 19 states. [2018-11-12 20:36:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:32,911 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-12 20:36:32,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:36:32,912 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-12 20:36:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:32,913 INFO L225 Difference]: With dead ends: 69 [2018-11-12 20:36:32,913 INFO L226 Difference]: Without dead ends: 64 [2018-11-12 20:36:32,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:36:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-12 20:36:32,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-12 20:36:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-12 20:36:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-12 20:36:32,918 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-11-12 20:36:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:32,918 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-12 20:36:32,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:36:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-12 20:36:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-12 20:36:32,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:32,919 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:32,919 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:32,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1690019387, now seen corresponding path program 17 times [2018-11-12 20:36:32,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:32,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:32,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:34,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:34,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:34,016 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:34,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:36:34,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:34,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:36:34,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:36:34,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:36:35,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-12 20:36:35,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:35,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:35,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:37,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:37,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-12 20:36:37,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:37,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:36:37,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:36:37,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:36:37,967 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 20 states. [2018-11-12 20:36:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:38,704 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-12 20:36:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:36:38,705 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-12 20:36:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:38,706 INFO L225 Difference]: With dead ends: 72 [2018-11-12 20:36:38,706 INFO L226 Difference]: Without dead ends: 67 [2018-11-12 20:36:38,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:36:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-12 20:36:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-12 20:36:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-12 20:36:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-12 20:36:38,712 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-11-12 20:36:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:38,712 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-12 20:36:38,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:36:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-12 20:36:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-12 20:36:38,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:38,713 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:38,713 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:38,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash 595615166, now seen corresponding path program 18 times [2018-11-12 20:36:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:38,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:38,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:38,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:38,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:39,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:39,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:39,202 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:39,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:36:39,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:39,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:36:39,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:36:39,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:36:39,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:36:39,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:36:39,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:39,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:42,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:42,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-12 20:36:42,782 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:42,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:36:42,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:36:42,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:36:42,784 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 21 states. [2018-11-12 20:36:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:43,334 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-12 20:36:43,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:36:43,335 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-12 20:36:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:43,336 INFO L225 Difference]: With dead ends: 75 [2018-11-12 20:36:43,336 INFO L226 Difference]: Without dead ends: 70 [2018-11-12 20:36:43,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:36:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-12 20:36:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-12 20:36:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-12 20:36:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-12 20:36:43,340 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-11-12 20:36:43,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:43,340 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-12 20:36:43,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:36:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-12 20:36:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-12 20:36:43,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:43,340 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:43,341 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:43,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:43,341 INFO L82 PathProgramCache]: Analyzing trace with hash 296211291, now seen corresponding path program 19 times [2018-11-12 20:36:43,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:43,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:43,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:36:43,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:43,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:44,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:44,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:44,033 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:44,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:36:44,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:44,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:36:44,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:44,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:36:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:44,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:44,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:47,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:47,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-12 20:36:47,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:47,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:36:47,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:36:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:36:47,526 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 22 states. [2018-11-12 20:36:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:48,134 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-12 20:36:48,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:36:48,134 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-12 20:36:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:48,135 INFO L225 Difference]: With dead ends: 78 [2018-11-12 20:36:48,136 INFO L226 Difference]: Without dead ends: 73 [2018-11-12 20:36:48,137 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:36:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-12 20:36:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-12 20:36:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-12 20:36:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-12 20:36:48,141 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-11-12 20:36:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:48,141 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-12 20:36:48,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:36:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-12 20:36:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-12 20:36:48,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:48,142 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:48,143 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:48,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:48,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1402444958, now seen corresponding path program 20 times [2018-11-12 20:36:48,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:48,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:48,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:48,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:48,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:48,554 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:48,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:36:48,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:48,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:36:48,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:36:48,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:37:03,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-12 20:37:03,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:37:03,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:03,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:07,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:07,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-12 20:37:07,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:07,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:37:07,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:37:07,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:37:07,212 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 23 states. [2018-11-12 20:37:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:07,890 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-12 20:37:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:37:07,891 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-11-12 20:37:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:07,892 INFO L225 Difference]: With dead ends: 81 [2018-11-12 20:37:07,892 INFO L226 Difference]: Without dead ends: 76 [2018-11-12 20:37:07,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:37:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-12 20:37:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-12 20:37:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-12 20:37:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-12 20:37:07,898 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-11-12 20:37:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:07,898 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-12 20:37:07,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:37:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-12 20:37:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-12 20:37:07,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:07,899 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:07,900 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:07,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1925556347, now seen corresponding path program 21 times [2018-11-12 20:37:07,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:07,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:37:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:07,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:08,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:08,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:08,392 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:08,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:37:08,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:08,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:37:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:37:08,400 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:37:08,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:37:08,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:37:08,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:08,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:12,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:12,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-12 20:37:12,381 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:12,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:37:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:37:12,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:37:12,382 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 24 states. [2018-11-12 20:37:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:13,109 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-12 20:37:13,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:37:13,109 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-12 20:37:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:13,111 INFO L225 Difference]: With dead ends: 84 [2018-11-12 20:37:13,111 INFO L226 Difference]: Without dead ends: 79 [2018-11-12 20:37:13,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:37:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-12 20:37:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-12 20:37:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-12 20:37:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-11-12 20:37:13,117 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-11-12 20:37:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:13,117 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-11-12 20:37:13,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:37:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-12 20:37:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-12 20:37:13,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:13,118 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:13,119 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:13,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:13,119 INFO L82 PathProgramCache]: Analyzing trace with hash -499371138, now seen corresponding path program 22 times [2018-11-12 20:37:13,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:13,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:13,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:37:13,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:13,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:13,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:13,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:13,594 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:13,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:37:13,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:13,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:37:13,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:37:13,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:37:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:13,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:13,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:17,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:17,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-12 20:37:17,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:17,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:37:17,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:37:17,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:37:17,597 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-11-12 20:37:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:18,410 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-12 20:37:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:37:18,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-12 20:37:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:18,412 INFO L225 Difference]: With dead ends: 87 [2018-11-12 20:37:18,412 INFO L226 Difference]: Without dead ends: 82 [2018-11-12 20:37:18,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:37:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-12 20:37:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-12 20:37:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-12 20:37:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-12 20:37:18,419 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-11-12 20:37:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:18,420 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-12 20:37:18,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:37:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-12 20:37:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-12 20:37:18,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:18,421 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:18,421 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:18,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:18,421 INFO L82 PathProgramCache]: Analyzing trace with hash -164158053, now seen corresponding path program 23 times [2018-11-12 20:37:18,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:18,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:18,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:37:18,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:18,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:19,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:19,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:19,038 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:19,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:37:19,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:19,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:37:19,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:37:19,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:39,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-12 20:38:39,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:40,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:40,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:44,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:44,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2018-11-12 20:38:44,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:44,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:38:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:38:44,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:38:44,310 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 26 states. [2018-11-12 20:38:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:45,210 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-12 20:38:45,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:38:45,210 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-11-12 20:38:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:45,211 INFO L225 Difference]: With dead ends: 90 [2018-11-12 20:38:45,212 INFO L226 Difference]: Without dead ends: 85 [2018-11-12 20:38:45,213 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:38:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-12 20:38:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-12 20:38:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-12 20:38:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-11-12 20:38:45,217 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-11-12 20:38:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:45,217 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-11-12 20:38:45,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:38:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-12 20:38:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-12 20:38:45,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:45,218 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:45,218 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:45,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:45,219 INFO L82 PathProgramCache]: Analyzing trace with hash 369893982, now seen corresponding path program 24 times [2018-11-12 20:38:45,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:45,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:45,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:45,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:45,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:46,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:46,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:46,249 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:46,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:46,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:46,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:46,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:46,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:46,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:46,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:46,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:46,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:51,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:51,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-12 20:38:51,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:51,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:38:51,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:38:51,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:38:51,132 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 27 states. [2018-11-12 20:38:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:52,057 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-12 20:38:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:38:52,058 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-12 20:38:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:52,059 INFO L225 Difference]: With dead ends: 93 [2018-11-12 20:38:52,059 INFO L226 Difference]: Without dead ends: 88 [2018-11-12 20:38:52,061 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:38:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-12 20:38:52,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-12 20:38:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-12 20:38:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-12 20:38:52,065 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-11-12 20:38:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:52,065 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-12 20:38:52,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:38:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-12 20:38:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-12 20:38:52,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:52,066 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:52,066 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:52,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:52,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1755204283, now seen corresponding path program 25 times [2018-11-12 20:38:52,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:52,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:52,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:52,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:52,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:52,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:52,622 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:52,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:52,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:52,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:52,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:52,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:52,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:52,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:57,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:57,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2018-11-12 20:38:57,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:57,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:38:57,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:38:57,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=2082, Unknown=0, NotChecked=0, Total=2862 [2018-11-12 20:38:57,819 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 28 states. [2018-11-12 20:38:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:58,939 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-12 20:38:58,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:38:58,940 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-12 20:38:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:58,941 INFO L225 Difference]: With dead ends: 96 [2018-11-12 20:38:58,941 INFO L226 Difference]: Without dead ends: 91 [2018-11-12 20:38:58,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=780, Invalid=2082, Unknown=0, NotChecked=0, Total=2862 [2018-11-12 20:38:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-12 20:38:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-12 20:38:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-12 20:38:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-11-12 20:38:58,946 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-11-12 20:38:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:58,947 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-11-12 20:38:58,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:38:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-12 20:38:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:38:58,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:58,947 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:58,947 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:58,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1193634110, now seen corresponding path program 26 times [2018-11-12 20:38:58,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:58,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:58,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:58,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:58,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:59,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:59,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:59,739 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:59,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:59,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:59,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:59,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:59,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:39:19,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-12 20:39:19,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:19,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:39:19,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-12 20:39:32,324 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-12 20:39:32,525 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:39:32,525 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:39:32,531 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:39:32,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:39:32 BoogieIcfgContainer [2018-11-12 20:39:32,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:39:32,532 INFO L168 Benchmark]: Toolchain (without parser) took 275810.06 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 940.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -470.6 MB). Peak memory consumption was 469.5 MB. Max. memory is 7.1 GB. [2018-11-12 20:39:32,533 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:39:32,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:39:32,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:39:32,534 INFO L168 Benchmark]: Boogie Preprocessor took 35.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:39:32,535 INFO L168 Benchmark]: RCFGBuilder took 394.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-12 20:39:32,535 INFO L168 Benchmark]: TraceAbstraction took 275024.59 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 190.8 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 323.6 MB). Peak memory consumption was 514.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:39:32,539 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 394.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275024.59 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 190.8 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 323.6 MB). Peak memory consumption was 514.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 27,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. TIMEOUT Result, 274.9s OverallTime, 35 OverallIterations, 27 TraceHistogramMax, 12.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 727 SDtfs, 36 SDslu, 8878 SDs, 0 SdLazy, 13366 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3216 GetRequests, 2395 SyntacticMatches, 65 SemanticMatches, 756 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 74.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 36 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 149.0s SatisfiabilityAnalysisTime, 77.2s InterpolantComputationTime, 2789 NumberOfCodeBlocks, 2780 NumberOfCodeBlocksAsserted, 181 NumberOfCheckSat, 4075 ConstructedInterpolants, 1 QuantifiedInterpolants, 1368497 SizeOfPredicates, 37 NumberOfNonLiveVariables, 2832 ConjunctsInSsa, 773 ConjunctsInUnsatCore, 98 InterpolantComputations, 8 PerfectInterpolantSequences, 108/25662 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown