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.epf -i ../../../trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:43:17,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:43:17,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:43:17,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:43:17,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:43:17,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:43:17,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:43:17,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:43:17,895 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:43:17,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:43:17,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:43:17,897 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:43:17,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:43:17,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:43:17,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:43:17,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:43:17,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:43:17,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:43:17,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:43:17,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:43:17,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:43:17,916 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:43:17,921 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:43:17,921 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:43:17,922 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:43:17,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:43:17,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:43:17,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:43:17,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:43:17,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:43:17,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:43:17,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:43:17,933 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:43:17,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:43:17,934 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:43:17,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:43:17,937 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.epf [2018-11-07 16:43:17,959 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:43:17,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:43:17,961 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:43:17,961 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:43:17,961 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:43:17,961 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:43:17,961 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:43:17,962 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:43:17,962 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:43:17,962 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:43:17,962 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:43:17,962 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:43:17,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:43:17,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:43:17,963 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:43:17,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:43:17,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:43:17,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:43:17,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:43:17,964 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:43:17,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:43:17,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:43:17,965 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:43:17,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:43:17,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:43:17,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:43:17,966 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:43:17,966 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:43:17,966 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:43:17,967 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:43:17,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:43:17,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:43:17,967 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:43:17,967 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:43:18,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:43:18,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:43:18,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:43:18,050 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:43:18,051 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:43:18,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i [2018-11-07 16:43:18,116 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a398ca46b/654cdf37801c4f808602b97cbea185d4/FLAG67fd5e4f5 [2018-11-07 16:43:18,561 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:43:18,562 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i [2018-11-07 16:43:18,568 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a398ca46b/654cdf37801c4f808602b97cbea185d4/FLAG67fd5e4f5 [2018-11-07 16:43:18,584 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a398ca46b/654cdf37801c4f808602b97cbea185d4 [2018-11-07 16:43:18,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:43:18,596 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:43:18,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:43:18,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:43:18,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:43:18,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f7c194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18, skipping insertion in model container [2018-11-07 16:43:18,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:43:18,646 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:43:18,882 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:43:18,885 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:43:18,905 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:43:18,919 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:43:18,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18 WrapperNode [2018-11-07 16:43:18,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:43:18,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:43:18,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:43:18,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:43:18,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:43:18,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:43:18,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:43:18,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:43:18,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (1/1) ... [2018-11-07 16:43:18,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:43:18,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:43:18,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:43:18,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:43:18,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (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-07 16:43:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:43:19,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:43:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:43:19,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:43:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:43:19,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:43:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:43:19,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:43:19,504 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:43:19,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:43:19 BoogieIcfgContainer [2018-11-07 16:43:19,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:43:19,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:43:19,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:43:19,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:43:19,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:43:18" (1/3) ... [2018-11-07 16:43:19,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eedab11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:43:19, skipping insertion in model container [2018-11-07 16:43:19,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:18" (2/3) ... [2018-11-07 16:43:19,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eedab11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:43:19, skipping insertion in model container [2018-11-07 16:43:19,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:43:19" (3/3) ... [2018-11-07 16:43:19,524 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple_true-unreach-call_true-termination.i [2018-11-07 16:43:19,535 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:43:19,544 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:43:19,558 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:43:19,593 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:43:19,593 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:43:19,593 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:43:19,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:43:19,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:43:19,594 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:43:19,594 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:43:19,594 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:43:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-07 16:43:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 16:43:19,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:19,623 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:19,625 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:19,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash 62896836, now seen corresponding path program 1 times [2018-11-07 16:43:19,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:19,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:19,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:19,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:19,747 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-07 16:43:19,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:43:19,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:43:19,749 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:19,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:43:19,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:43:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:43:19,768 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-07 16:43:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:19,792 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-07 16:43:19,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:43:19,793 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-07 16:43:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:19,801 INFO L225 Difference]: With dead ends: 52 [2018-11-07 16:43:19,801 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 16:43:19,805 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-07 16:43:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 16:43:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 16:43:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 16:43:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-07 16:43:19,843 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-07 16:43:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:19,844 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-07 16:43:19,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:43:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-07 16:43:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 16:43:19,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:19,845 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:19,846 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:19,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash -111227420, now seen corresponding path program 1 times [2018-11-07 16:43:19,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:19,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:19,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:19,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:19,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:20,139 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-07 16:43:20,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:43:20,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:43:20,140 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:20,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:43:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:43:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:43:20,143 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-07 16:43:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:20,269 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-07 16:43:20,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:43:20,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-07 16:43:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:20,271 INFO L225 Difference]: With dead ends: 35 [2018-11-07 16:43:20,272 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 16:43:20,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:43:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 16:43:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-07 16:43:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 16:43:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-07 16:43:20,282 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 20 [2018-11-07 16:43:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:20,282 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-07 16:43:20,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:43:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-07 16:43:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:43:20,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:20,284 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:20,284 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:20,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1352658359, now seen corresponding path program 1 times [2018-11-07 16:43:20,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:20,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:20,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:20,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:20,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:20,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:43:20,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:43:20,407 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:20,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:43:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:43:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:43:20,409 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2018-11-07 16:43:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:20,804 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-07 16:43:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:43:20,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-07 16:43:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:20,808 INFO L225 Difference]: With dead ends: 57 [2018-11-07 16:43:20,809 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:43:20,810 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:43:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:43:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-07 16:43:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 16:43:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 16:43:20,822 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2018-11-07 16:43:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:20,822 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 16:43:20,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:43:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 16:43:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:43:20,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:20,824 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:20,824 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:20,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:20,825 INFO L82 PathProgramCache]: Analyzing trace with hash -38707475, now seen corresponding path program 1 times [2018-11-07 16:43:20,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:20,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:20,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:20,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:20,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:20,963 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 16:43:20,965 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [10], [13], [21], [25], [29], [31], [34], [36], [40], [44], [50], [52], [57], [63], [66], [68], [71], [73], [74], [75], [76], [78], [79] [2018-11-07 16:43:21,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:21,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:21,405 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:21,407 INFO L272 AbstractInterpreter]: Visited 26 different actions 171 times. Merged at 10 different actions 78 times. Widened at 3 different actions 9 times. Found 7 fixpoints after 3 different actions. Largest state had 9 variables. [2018-11-07 16:43:21,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:21,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:21,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:21,444 INFO L194 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-07 16:43:21,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:21,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:21,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:21,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:21,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:21,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2018-11-07 16:43:21,934 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:21,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:43:21,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:43:21,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:43:21,936 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2018-11-07 16:43:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:22,674 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-07 16:43:22,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:43:22,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-07 16:43:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:22,676 INFO L225 Difference]: With dead ends: 72 [2018-11-07 16:43:22,676 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 16:43:22,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:43:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 16:43:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-11-07 16:43:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 16:43:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-07 16:43:22,687 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2018-11-07 16:43:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:22,687 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-07 16:43:22,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:43:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-07 16:43:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 16:43:22,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:22,690 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:22,690 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:22,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:22,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1515908604, now seen corresponding path program 2 times [2018-11-07 16:43:22,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:22,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:22,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:22,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:22,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:43:22,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:22,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:22,851 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:22,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:22,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:22,851 INFO L194 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-07 16:43:22,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:43:22,872 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:43:22,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:43:22,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:22,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:43:23,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:43:23,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:23,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2018-11-07 16:43:23,372 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:23,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:43:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:43:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:43:23,373 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 14 states. [2018-11-07 16:43:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:23,839 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2018-11-07 16:43:23,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:43:23,839 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 16:43:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:23,843 INFO L225 Difference]: With dead ends: 92 [2018-11-07 16:43:23,843 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 16:43:23,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:43:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 16:43:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-11-07 16:43:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 16:43:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-07 16:43:23,855 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 44 [2018-11-07 16:43:23,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:23,855 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-07 16:43:23,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:43:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-07 16:43:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 16:43:23,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:23,857 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:23,858 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:23,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:23,858 INFO L82 PathProgramCache]: Analyzing trace with hash 775099085, now seen corresponding path program 3 times [2018-11-07 16:43:23,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:23,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:23,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:23,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:23,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:43:24,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:24,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:24,019 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:24,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:24,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:24,020 INFO L194 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-07 16:43:24,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:43:24,035 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:43:24,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:43:24,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:24,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:43:24,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:43:24,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:24,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2018-11-07 16:43:24,484 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:24,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:43:24,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:43:24,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:43:24,486 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 14 states. [2018-11-07 16:43:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:24,781 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2018-11-07 16:43:24,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:43:24,781 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-11-07 16:43:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:24,783 INFO L225 Difference]: With dead ends: 103 [2018-11-07 16:43:24,783 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 16:43:24,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:43:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 16:43:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2018-11-07 16:43:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 16:43:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-07 16:43:24,793 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 56 [2018-11-07 16:43:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:24,793 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-07 16:43:24,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:43:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-07 16:43:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 16:43:24,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:24,796 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:24,796 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:24,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:24,797 INFO L82 PathProgramCache]: Analyzing trace with hash -916783191, now seen corresponding path program 4 times [2018-11-07 16:43:24,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:24,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:24,798 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 35 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:43:24,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:24,948 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:24,949 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:24,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:24,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:24,949 INFO L194 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-07 16:43:24,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:24,958 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:24,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:43:25,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:43:25,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:25,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 13 [2018-11-07 16:43:25,160 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:25,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:43:25,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:43:25,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:43:25,162 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2018-11-07 16:43:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:25,322 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-07 16:43:25,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:43:25,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-07 16:43:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:25,326 INFO L225 Difference]: With dead ends: 72 [2018-11-07 16:43:25,326 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 16:43:25,327 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:43:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 16:43:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-07 16:43:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 16:43:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-11-07 16:43:25,337 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 59 [2018-11-07 16:43:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:25,338 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-11-07 16:43:25,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:43:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-11-07 16:43:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 16:43:25,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:25,341 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:25,341 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:25,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:25,341 INFO L82 PathProgramCache]: Analyzing trace with hash 928258569, now seen corresponding path program 5 times [2018-11-07 16:43:25,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:25,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:25,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:25,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:25,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:25,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:25,516 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:25,517 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:25,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:25,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:25,517 INFO L194 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-07 16:43:25,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:43:25,529 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:43:25,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:43:25,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:25,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:25,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:26,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:26,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2018-11-07 16:43:26,076 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:26,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:43:26,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:43:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:43:26,077 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 19 states. [2018-11-07 16:43:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:26,397 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2018-11-07 16:43:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:43:26,397 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-11-07 16:43:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:26,399 INFO L225 Difference]: With dead ends: 135 [2018-11-07 16:43:26,399 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 16:43:26,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 139 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:43:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 16:43:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2018-11-07 16:43:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 16:43:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-11-07 16:43:26,410 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 77 [2018-11-07 16:43:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:26,411 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-11-07 16:43:26,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:43:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-11-07 16:43:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 16:43:26,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:26,413 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:26,413 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:26,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash -846983507, now seen corresponding path program 6 times [2018-11-07 16:43:26,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:26,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:26,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:26,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:26,614 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:26,614 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:26,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:26,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:26,615 INFO L194 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-07 16:43:26,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:43:26,629 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:43:26,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:43:26,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:26,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:27,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:27,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:27,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 20 [2018-11-07 16:43:27,427 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:27,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:43:27,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:43:27,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:43:27,429 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 20 states. [2018-11-07 16:43:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:27,937 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2018-11-07 16:43:27,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:43:27,937 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-11-07 16:43:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:27,938 INFO L225 Difference]: With dead ends: 141 [2018-11-07 16:43:27,939 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 16:43:27,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 144 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:43:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 16:43:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2018-11-07 16:43:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-07 16:43:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-11-07 16:43:27,952 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 80 [2018-11-07 16:43:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:27,952 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-07 16:43:27,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:43:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-11-07 16:43:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 16:43:27,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:27,954 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:27,954 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:27,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:27,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1143613321, now seen corresponding path program 7 times [2018-11-07 16:43:27,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:27,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:27,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 72 proven. 78 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:43:28,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:28,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:28,218 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:28,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:28,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:28,219 INFO L194 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-07 16:43:28,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:28,232 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:28,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:28,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 73 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:28,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:28,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2018-11-07 16:43:28,649 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:28,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:43:28,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:43:28,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:43:28,651 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 14 states. [2018-11-07 16:43:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:28,860 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-07 16:43:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:43:28,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2018-11-07 16:43:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:28,864 INFO L225 Difference]: With dead ends: 90 [2018-11-07 16:43:28,864 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 16:43:28,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 160 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:43:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 16:43:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-07 16:43:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-07 16:43:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-11-07 16:43:28,874 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 83 [2018-11-07 16:43:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:28,874 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-11-07 16:43:28,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:43:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-11-07 16:43:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 16:43:28,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:28,876 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:28,876 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:28,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash 643631593, now seen corresponding path program 8 times [2018-11-07 16:43:28,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:28,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:28,878 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 140 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:43:29,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:29,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:29,099 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:29,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:29,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:29,099 INFO L194 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-07 16:43:29,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:43:29,111 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:43:29,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 16:43:29,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:29,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 140 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:43:29,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 140 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:43:29,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:29,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2018-11-07 16:43:29,770 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:29,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:43:29,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:43:29,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2018-11-07 16:43:29,771 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 25 states. [2018-11-07 16:43:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:30,102 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2018-11-07 16:43:30,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:43:30,103 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 101 [2018-11-07 16:43:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:30,104 INFO L225 Difference]: With dead ends: 175 [2018-11-07 16:43:30,105 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 16:43:30,105 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 181 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:43:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 16:43:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 91. [2018-11-07 16:43:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 16:43:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-11-07 16:43:30,114 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 101 [2018-11-07 16:43:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:30,115 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-11-07 16:43:30,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:43:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-11-07 16:43:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 16:43:30,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:30,117 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:30,117 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:30,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:30,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1746775411, now seen corresponding path program 9 times [2018-11-07 16:43:30,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:30,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:30,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:30,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:30,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 140 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:43:30,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:30,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:30,449 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:30,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:30,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:30,449 INFO L194 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-07 16:43:30,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:43:30,457 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:43:30,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:43:30,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:30,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 140 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:43:30,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 140 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:43:30,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:30,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 26 [2018-11-07 16:43:30,898 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:30,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 16:43:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 16:43:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:43:30,900 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 26 states. [2018-11-07 16:43:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:31,382 INFO L93 Difference]: Finished difference Result 181 states and 212 transitions. [2018-11-07 16:43:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:43:31,382 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2018-11-07 16:43:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:31,384 INFO L225 Difference]: With dead ends: 181 [2018-11-07 16:43:31,384 INFO L226 Difference]: Without dead ends: 134 [2018-11-07 16:43:31,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 186 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:43:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-07 16:43:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2018-11-07 16:43:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-07 16:43:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-11-07 16:43:31,393 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 104 [2018-11-07 16:43:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:31,394 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-11-07 16:43:31,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 16:43:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-11-07 16:43:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 16:43:31,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:31,396 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:31,396 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:31,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash 490903401, now seen corresponding path program 10 times [2018-11-07 16:43:31,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:31,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:31,397 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 121 proven. 145 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:43:31,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:31,680 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:31,680 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:31,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:31,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:31,680 INFO L194 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-07 16:43:31,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:31,691 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:31,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 122 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:43:31,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 122 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:43:32,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:32,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 17 [2018-11-07 16:43:32,001 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:32,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:43:32,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:43:32,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:43:32,002 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 16 states. [2018-11-07 16:43:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:32,188 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-11-07 16:43:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:43:32,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2018-11-07 16:43:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:32,190 INFO L225 Difference]: With dead ends: 110 [2018-11-07 16:43:32,190 INFO L226 Difference]: Without dead ends: 108 [2018-11-07 16:43:32,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 206 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:43:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-07 16:43:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-07 16:43:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 16:43:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-11-07 16:43:32,200 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 107 [2018-11-07 16:43:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:32,201 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-11-07 16:43:32,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:43:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-11-07 16:43:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 16:43:32,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:32,205 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:32,205 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:32,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1091747383, now seen corresponding path program 11 times [2018-11-07 16:43:32,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:32,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:32,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 225 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:43:32,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:32,515 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:32,515 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:32,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:32,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:32,516 INFO L194 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-07 16:43:32,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:43:32,524 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:43:32,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 16:43:32,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:32,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 225 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:43:32,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 225 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:43:33,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:33,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2018-11-07 16:43:33,355 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:33,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:43:33,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:43:33,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 16:43:33,356 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 31 states. [2018-11-07 16:43:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:33,745 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2018-11-07 16:43:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:43:33,745 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2018-11-07 16:43:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:33,747 INFO L225 Difference]: With dead ends: 215 [2018-11-07 16:43:33,747 INFO L226 Difference]: Without dead ends: 156 [2018-11-07 16:43:33,748 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 223 SyntacticMatches, 16 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=480, Invalid=1242, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:43:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-07 16:43:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 111. [2018-11-07 16:43:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 16:43:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-11-07 16:43:33,757 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 125 [2018-11-07 16:43:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:33,757 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-11-07 16:43:33,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:43:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-11-07 16:43:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 16:43:33,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:33,759 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:33,759 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:33,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1980489325, now seen corresponding path program 12 times [2018-11-07 16:43:33,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:33,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:33,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 225 proven. 135 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:43:33,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:33,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:33,995 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:33,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:33,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:33,996 INFO L194 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-07 16:43:34,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:43:34,005 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:43:34,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:43:34,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:34,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 225 proven. 135 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:43:34,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 225 proven. 135 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:43:34,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:34,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 32 [2018-11-07 16:43:34,534 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:34,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 16:43:34,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 16:43:34,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:43:34,536 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 32 states. [2018-11-07 16:43:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:35,111 INFO L93 Difference]: Finished difference Result 221 states and 259 transitions. [2018-11-07 16:43:35,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:43:35,112 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 128 [2018-11-07 16:43:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:35,113 INFO L225 Difference]: With dead ends: 221 [2018-11-07 16:43:35,113 INFO L226 Difference]: Without dead ends: 164 [2018-11-07 16:43:35,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 228 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:43:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-07 16:43:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2018-11-07 16:43:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 16:43:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-11-07 16:43:35,124 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 128 [2018-11-07 16:43:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:35,124 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-11-07 16:43:35,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 16:43:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-11-07 16:43:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 16:43:35,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:35,126 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:35,126 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:35,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1231179593, now seen corresponding path program 13 times [2018-11-07 16:43:35,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:35,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:35,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:35,128 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 182 proven. 232 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:43:35,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:35,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:35,380 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:35,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:35,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:35,381 INFO L194 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-07 16:43:35,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:35,389 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:35,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 183 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:43:35,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 183 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:43:35,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:35,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 19 [2018-11-07 16:43:35,709 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:35,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:43:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:43:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:43:35,710 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 18 states. [2018-11-07 16:43:35,988 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-07 16:43:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:36,099 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-07 16:43:36,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:43:36,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 131 [2018-11-07 16:43:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:36,102 INFO L225 Difference]: With dead ends: 130 [2018-11-07 16:43:36,103 INFO L226 Difference]: Without dead ends: 128 [2018-11-07 16:43:36,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 252 SyntacticMatches, 19 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:43:36,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-07 16:43:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-07 16:43:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 16:43:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-11-07 16:43:36,113 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 131 [2018-11-07 16:43:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:36,113 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-11-07 16:43:36,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:43:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-07 16:43:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 16:43:36,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:36,115 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:36,115 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:36,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2109554263, now seen corresponding path program 14 times [2018-11-07 16:43:36,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:36,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:36,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:36,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:36,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 330 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:43:37,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:37,032 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:37,032 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:37,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:37,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:37,033 INFO L194 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-07 16:43:37,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:43:37,047 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:43:37,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 16:43:37,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:37,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 330 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:43:37,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 330 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:43:38,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:38,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2018-11-07 16:43:38,461 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:38,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 16:43:38,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 16:43:38,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1107, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:43:38,463 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 37 states. [2018-11-07 16:43:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:39,671 INFO L93 Difference]: Finished difference Result 255 states and 297 transitions. [2018-11-07 16:43:39,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:43:39,671 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2018-11-07 16:43:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:39,673 INFO L225 Difference]: With dead ends: 255 [2018-11-07 16:43:39,673 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 16:43:39,674 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 265 SyntacticMatches, 20 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 16:43:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 16:43:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 131. [2018-11-07 16:43:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 16:43:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-11-07 16:43:39,683 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 149 [2018-11-07 16:43:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:39,684 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-11-07 16:43:39,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 16:43:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-11-07 16:43:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-07 16:43:39,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:39,685 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:39,686 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:39,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1564389965, now seen corresponding path program 15 times [2018-11-07 16:43:39,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:39,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:39,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:39,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:39,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 330 proven. 198 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:43:40,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:40,127 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:40,128 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:40,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:40,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:40,128 INFO L194 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-07 16:43:40,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:43:40,139 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:43:40,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:43:40,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:40,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 330 proven. 198 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:43:40,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 330 proven. 198 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:43:40,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:40,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 38 [2018-11-07 16:43:40,835 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:40,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 16:43:40,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 16:43:40,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:43:40,837 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 38 states. [2018-11-07 16:43:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:41,373 INFO L93 Difference]: Finished difference Result 261 states and 306 transitions. [2018-11-07 16:43:41,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 16:43:41,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 152 [2018-11-07 16:43:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:41,376 INFO L225 Difference]: With dead ends: 261 [2018-11-07 16:43:41,376 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 16:43:41,377 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 270 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 16:43:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 16:43:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 134. [2018-11-07 16:43:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-07 16:43:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-11-07 16:43:41,389 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 152 [2018-11-07 16:43:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:41,390 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-11-07 16:43:41,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 16:43:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-11-07 16:43:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 16:43:41,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:41,391 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:41,391 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:41,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash -909684951, now seen corresponding path program 16 times [2018-11-07 16:43:41,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:41,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:41,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:41,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:41,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 255 proven. 339 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:43:41,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:41,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:41,859 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:41,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:41,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:41,860 INFO L194 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-07 16:43:41,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:41,869 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:41,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 256 proven. 308 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:43:41,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 256 proven. 308 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:43:42,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:42,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 21 [2018-11-07 16:43:42,223 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:42,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:43:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:43:42,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:43:42,224 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 20 states. [2018-11-07 16:43:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:42,584 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-07 16:43:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:43:42,584 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 155 [2018-11-07 16:43:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:42,586 INFO L225 Difference]: With dead ends: 150 [2018-11-07 16:43:42,586 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 16:43:42,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 298 SyntacticMatches, 23 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-11-07 16:43:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 16:43:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-11-07 16:43:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-07 16:43:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-11-07 16:43:42,596 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 155 [2018-11-07 16:43:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:42,597 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-11-07 16:43:42,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:43:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-11-07 16:43:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 16:43:42,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:42,598 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:42,599 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:42,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:42,599 INFO L82 PathProgramCache]: Analyzing trace with hash -568620663, now seen corresponding path program 17 times [2018-11-07 16:43:42,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:42,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:42,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:42,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:42,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 455 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:43,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:43,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:43,691 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:43,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:43,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:43,691 INFO L194 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-07 16:43:43,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:43:43,701 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:43:43,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 16:43:43,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:43,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 455 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:44,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 455 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:44,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:44,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2018-11-07 16:43:44,653 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:44,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 16:43:44,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 16:43:44,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=1487, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:43:44,655 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 43 states. [2018-11-07 16:43:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:46,306 INFO L93 Difference]: Finished difference Result 295 states and 344 transitions. [2018-11-07 16:43:46,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:43:46,307 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 173 [2018-11-07 16:43:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:46,309 INFO L225 Difference]: With dead ends: 295 [2018-11-07 16:43:46,309 INFO L226 Difference]: Without dead ends: 216 [2018-11-07 16:43:46,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 307 SyntacticMatches, 24 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 16:43:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-07 16:43:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 151. [2018-11-07 16:43:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-07 16:43:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-11-07 16:43:46,321 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 173 [2018-11-07 16:43:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:46,321 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-07 16:43:46,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 16:43:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-11-07 16:43:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 16:43:46,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:46,323 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:46,323 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:46,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash 792251949, now seen corresponding path program 18 times [2018-11-07 16:43:46,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:46,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:46,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 455 proven. 273 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:46,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:46,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:46,907 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:46,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:46,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:46,907 INFO L194 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-07 16:43:46,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:43:46,918 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:43:46,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:43:46,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:46,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 455 proven. 273 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:47,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 455 proven. 273 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:47,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:47,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 44 [2018-11-07 16:43:47,671 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:47,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 16:43:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 16:43:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:43:47,673 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 44 states. [2018-11-07 16:43:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:48,338 INFO L93 Difference]: Finished difference Result 301 states and 353 transitions. [2018-11-07 16:43:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 16:43:48,338 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 176 [2018-11-07 16:43:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:48,339 INFO L225 Difference]: With dead ends: 301 [2018-11-07 16:43:48,340 INFO L226 Difference]: Without dead ends: 224 [2018-11-07 16:43:48,341 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 312 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=897, Invalid=2409, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 16:43:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-07 16:43:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 154. [2018-11-07 16:43:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-07 16:43:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-11-07 16:43:48,351 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 176 [2018-11-07 16:43:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:48,351 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-11-07 16:43:48,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 16:43:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-11-07 16:43:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 16:43:48,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:48,353 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:48,353 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:48,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:48,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1943038199, now seen corresponding path program 19 times [2018-11-07 16:43:48,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:48,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:48,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:48,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:48,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 340 proven. 466 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:43:48,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:48,989 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:48,989 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:48,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:48,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:48,990 INFO L194 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-07 16:43:48,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:48,998 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:49,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 341 proven. 429 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:49,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 341 proven. 429 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:49,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:49,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 23 [2018-11-07 16:43:49,449 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:49,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:43:49,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:43:49,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2018-11-07 16:43:49,450 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 22 states. [2018-11-07 16:43:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:49,674 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-11-07 16:43:49,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:43:49,677 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2018-11-07 16:43:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:49,679 INFO L225 Difference]: With dead ends: 170 [2018-11-07 16:43:49,679 INFO L226 Difference]: Without dead ends: 168 [2018-11-07 16:43:49,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 344 SyntacticMatches, 27 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2018-11-07 16:43:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-07 16:43:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-11-07 16:43:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-07 16:43:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2018-11-07 16:43:49,703 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 179 [2018-11-07 16:43:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:49,704 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2018-11-07 16:43:49,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:43:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2018-11-07 16:43:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 16:43:49,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:49,705 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:49,706 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:49,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:49,706 INFO L82 PathProgramCache]: Analyzing trace with hash 213227881, now seen corresponding path program 20 times [2018-11-07 16:43:49,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:49,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:49,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 600 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:43:50,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:50,195 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:50,195 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:50,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:50,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:50,195 INFO L194 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-07 16:43:50,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:43:50,204 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:43:50,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-07 16:43:50,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:50,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 600 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:43:50,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 600 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:43:51,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:51,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-11-07 16:43:51,208 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:51,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 16:43:51,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 16:43:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1923, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 16:43:51,210 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 49 states. [2018-11-07 16:43:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:53,761 INFO L93 Difference]: Finished difference Result 335 states and 391 transitions. [2018-11-07 16:43:53,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 16:43:53,762 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 197 [2018-11-07 16:43:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:53,764 INFO L225 Difference]: With dead ends: 335 [2018-11-07 16:43:53,764 INFO L226 Difference]: Without dead ends: 246 [2018-11-07 16:43:53,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 349 SyntacticMatches, 28 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1152, Invalid=3138, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 16:43:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-07 16:43:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 171. [2018-11-07 16:43:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 16:43:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2018-11-07 16:43:53,777 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 197 [2018-11-07 16:43:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:53,777 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2018-11-07 16:43:53,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 16:43:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2018-11-07 16:43:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 16:43:53,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:53,779 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:53,779 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:53,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1707593203, now seen corresponding path program 21 times [2018-11-07 16:43:53,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:53,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:53,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:53,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:53,781 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 600 proven. 360 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:43:54,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:54,285 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:54,285 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:54,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:54,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:54,286 INFO L194 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-07 16:43:54,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:43:54,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:43:54,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:43:54,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:54,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 600 proven. 360 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:43:55,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 600 proven. 360 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:43:55,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:55,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 50 [2018-11-07 16:43:55,650 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:55,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 16:43:55,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 16:43:55,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 16:43:55,652 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand 50 states. [2018-11-07 16:43:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:57,036 INFO L93 Difference]: Finished difference Result 341 states and 400 transitions. [2018-11-07 16:43:57,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 16:43:57,036 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 200 [2018-11-07 16:43:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:57,039 INFO L225 Difference]: With dead ends: 341 [2018-11-07 16:43:57,039 INFO L226 Difference]: Without dead ends: 254 [2018-11-07 16:43:57,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 354 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 16:43:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-07 16:43:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 174. [2018-11-07 16:43:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 16:43:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2018-11-07 16:43:57,052 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 200 [2018-11-07 16:43:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:57,053 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-11-07 16:43:57,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 16:43:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2018-11-07 16:43:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 16:43:57,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:57,054 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:57,055 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:57,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1255745257, now seen corresponding path program 22 times [2018-11-07 16:43:57,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:57,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:43:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:57,056 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 437 proven. 613 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 16:43:58,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:58,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:58,097 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:43:58,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:43:58,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:58,097 INFO L194 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-07 16:43:58,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:58,106 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:58,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 438 proven. 570 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:43:58,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 438 proven. 570 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:43:58,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:58,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 25 [2018-11-07 16:43:58,606 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:58,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:43:58,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:43:58,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-11-07 16:43:58,608 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 24 states. [2018-11-07 16:43:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:59,174 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2018-11-07 16:43:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:43:59,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 203 [2018-11-07 16:43:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:59,179 INFO L225 Difference]: With dead ends: 190 [2018-11-07 16:43:59,179 INFO L226 Difference]: Without dead ends: 188 [2018-11-07 16:43:59,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 390 SyntacticMatches, 31 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-11-07 16:43:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-07 16:43:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-11-07 16:43:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-07 16:43:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-11-07 16:43:59,190 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 203 [2018-11-07 16:43:59,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:59,191 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-11-07 16:43:59,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:43:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-11-07 16:43:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 16:43:59,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:59,192 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:59,193 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:59,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash -187764407, now seen corresponding path program 23 times [2018-11-07 16:43:59,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:59,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:59,194 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 765 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:00,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:00,127 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:00,127 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:00,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:00,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:00,127 INFO L194 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-07 16:44:00,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:00,135 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:00,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 16:44:00,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:00,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 765 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:01,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 765 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:02,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:02,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2018-11-07 16:44:02,109 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:02,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 16:44:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 16:44:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=777, Invalid=2415, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 16:44:02,112 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 55 states. [2018-11-07 16:44:03,361 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 16:44:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:03,381 INFO L93 Difference]: Finished difference Result 375 states and 438 transitions. [2018-11-07 16:44:03,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 16:44:03,382 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 221 [2018-11-07 16:44:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:03,384 INFO L225 Difference]: With dead ends: 375 [2018-11-07 16:44:03,384 INFO L226 Difference]: Without dead ends: 276 [2018-11-07 16:44:03,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 391 SyntacticMatches, 32 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1440, Invalid=3962, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 16:44:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-07 16:44:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 191. [2018-11-07 16:44:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-07 16:44:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2018-11-07 16:44:03,403 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 221 [2018-11-07 16:44:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:03,404 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2018-11-07 16:44:03,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 16:44:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2018-11-07 16:44:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-07 16:44:03,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:03,406 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:03,406 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:03,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:03,406 INFO L82 PathProgramCache]: Analyzing trace with hash -117776915, now seen corresponding path program 24 times [2018-11-07 16:44:03,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:03,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:03,407 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 765 proven. 459 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:04,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:04,349 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:04,349 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:04,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:04,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:04,349 INFO L194 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-07 16:44:04,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:04,360 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:04,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:04,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:04,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 765 proven. 459 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:05,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 765 proven. 459 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:06,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:06,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 56 [2018-11-07 16:44:06,247 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:06,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 16:44:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 16:44:06,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 16:44:06,249 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 56 states. [2018-11-07 16:44:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:08,164 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2018-11-07 16:44:08,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 16:44:08,164 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 224 [2018-11-07 16:44:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:08,166 INFO L225 Difference]: With dead ends: 381 [2018-11-07 16:44:08,167 INFO L226 Difference]: Without dead ends: 284 [2018-11-07 16:44:08,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 396 SyntacticMatches, 35 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1441, Invalid=3961, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 16:44:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-07 16:44:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 194. [2018-11-07 16:44:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 16:44:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2018-11-07 16:44:08,182 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 224 [2018-11-07 16:44:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:08,182 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2018-11-07 16:44:08,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 16:44:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2018-11-07 16:44:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 16:44:08,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:08,184 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:08,184 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:08,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1820458697, now seen corresponding path program 25 times [2018-11-07 16:44:08,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:08,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:08,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:08,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:08,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 546 proven. 780 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:44:09,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:09,398 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:09,398 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:09,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:09,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:09,398 INFO L194 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-07 16:44:09,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:09,407 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:09,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 547 proven. 731 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:09,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 547 proven. 731 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:10,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:10,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 27 [2018-11-07 16:44:10,185 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:10,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 16:44:10,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 16:44:10,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-11-07 16:44:10,186 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 26 states. [2018-11-07 16:44:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:10,442 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-11-07 16:44:10,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:44:10,442 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 227 [2018-11-07 16:44:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:10,445 INFO L225 Difference]: With dead ends: 210 [2018-11-07 16:44:10,445 INFO L226 Difference]: Without dead ends: 208 [2018-11-07 16:44:10,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 436 SyntacticMatches, 35 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:44:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-07 16:44:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-11-07 16:44:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-07 16:44:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-11-07 16:44:10,456 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 227 [2018-11-07 16:44:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:10,457 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-11-07 16:44:10,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 16:44:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-11-07 16:44:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-07 16:44:10,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:10,459 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:10,459 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:10,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:10,459 INFO L82 PathProgramCache]: Analyzing trace with hash 161845545, now seen corresponding path program 26 times [2018-11-07 16:44:10,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:10,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:10,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:10,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:10,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 950 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:44:11,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:11,237 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:11,237 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:11,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:11,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:11,238 INFO L194 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-07 16:44:11,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:11,246 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:11,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 16:44:11,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:11,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 950 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:44:12,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 950 proven. 513 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:44:12,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:12,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2018-11-07 16:44:12,578 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:12,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-07 16:44:12,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-07 16:44:12,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=943, Invalid=2963, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 16:44:12,580 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 61 states. [2018-11-07 16:44:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:13,470 INFO L93 Difference]: Finished difference Result 415 states and 485 transitions. [2018-11-07 16:44:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 16:44:13,471 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 245 [2018-11-07 16:44:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:13,473 INFO L225 Difference]: With dead ends: 415 [2018-11-07 16:44:13,473 INFO L226 Difference]: Without dead ends: 306 [2018-11-07 16:44:13,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 433 SyntacticMatches, 36 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 16:44:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-07 16:44:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 211. [2018-11-07 16:44:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-07 16:44:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2018-11-07 16:44:13,489 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 245 [2018-11-07 16:44:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:13,489 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2018-11-07 16:44:13,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-07 16:44:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2018-11-07 16:44:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 16:44:13,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:13,491 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:13,491 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:13,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:13,491 INFO L82 PathProgramCache]: Analyzing trace with hash 851366349, now seen corresponding path program 27 times [2018-11-07 16:44:13,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:13,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:13,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:13,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:13,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 950 proven. 570 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:44:14,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:14,697 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:14,697 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:14,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:14,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:14,698 INFO L194 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-07 16:44:14,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:14,708 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:14,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:14,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:14,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 950 proven. 570 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:44:15,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 950 proven. 570 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:44:16,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:16,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 62 [2018-11-07 16:44:16,638 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:16,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-07 16:44:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-07 16:44:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2881, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 16:44:16,639 INFO L87 Difference]: Start difference. First operand 211 states and 224 transitions. Second operand 62 states. [2018-11-07 16:44:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:17,699 INFO L93 Difference]: Finished difference Result 421 states and 494 transitions. [2018-11-07 16:44:17,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 16:44:17,700 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 248 [2018-11-07 16:44:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:17,702 INFO L225 Difference]: With dead ends: 421 [2018-11-07 16:44:17,702 INFO L226 Difference]: Without dead ends: 314 [2018-11-07 16:44:17,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 438 SyntacticMatches, 39 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1761, Invalid=4881, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 16:44:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-07 16:44:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 214. [2018-11-07 16:44:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-07 16:44:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 227 transitions. [2018-11-07 16:44:17,718 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 227 transitions. Word has length 248 [2018-11-07 16:44:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:17,719 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 227 transitions. [2018-11-07 16:44:17,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-07 16:44:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 227 transitions. [2018-11-07 16:44:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-07 16:44:17,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:17,721 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:17,721 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:17,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:17,721 INFO L82 PathProgramCache]: Analyzing trace with hash -462938455, now seen corresponding path program 28 times [2018-11-07 16:44:17,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:17,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:17,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:17,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:17,722 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 667 proven. 967 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 16:44:18,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:18,133 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:18,133 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:18,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:18,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:18,133 INFO L194 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-07 16:44:18,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:18,142 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:18,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 668 proven. 912 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:44:18,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 668 proven. 912 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:44:18,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:18,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 29 [2018-11-07 16:44:18,945 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:18,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:44:18,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:44:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=524, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:44:18,946 INFO L87 Difference]: Start difference. First operand 214 states and 227 transitions. Second operand 28 states. [2018-11-07 16:44:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:19,391 INFO L93 Difference]: Finished difference Result 230 states and 244 transitions. [2018-11-07 16:44:19,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 16:44:19,391 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 251 [2018-11-07 16:44:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:19,393 INFO L225 Difference]: With dead ends: 230 [2018-11-07 16:44:19,393 INFO L226 Difference]: Without dead ends: 228 [2018-11-07 16:44:19,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 482 SyntacticMatches, 39 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=629, Unknown=0, NotChecked=0, Total=930 [2018-11-07 16:44:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-07 16:44:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-11-07 16:44:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-07 16:44:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 242 transitions. [2018-11-07 16:44:19,409 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 242 transitions. Word has length 251 [2018-11-07 16:44:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:19,410 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 242 transitions. [2018-11-07 16:44:19,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:44:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 242 transitions. [2018-11-07 16:44:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 16:44:19,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:19,412 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:19,412 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:19,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash 720861449, now seen corresponding path program 29 times [2018-11-07 16:44:19,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:19,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:19,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:19,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:19,413 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1155 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:44:20,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:20,361 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:20,361 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:20,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:20,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:20,361 INFO L194 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-07 16:44:20,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:20,369 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:20,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-07 16:44:20,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:20,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1155 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:44:21,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 1155 proven. 630 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:44:22,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:22,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2018-11-07 16:44:22,021 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:22,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 16:44:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 16:44:22,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=3567, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 16:44:22,023 INFO L87 Difference]: Start difference. First operand 228 states and 242 transitions. Second operand 67 states. [2018-11-07 16:44:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:23,247 INFO L93 Difference]: Finished difference Result 455 states and 532 transitions. [2018-11-07 16:44:23,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 16:44:23,247 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 269 [2018-11-07 16:44:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:23,249 INFO L225 Difference]: With dead ends: 455 [2018-11-07 16:44:23,249 INFO L226 Difference]: Without dead ends: 336 [2018-11-07 16:44:23,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 475 SyntacticMatches, 40 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2771 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2112, Invalid=5898, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 16:44:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-11-07 16:44:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 231. [2018-11-07 16:44:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-07 16:44:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 245 transitions. [2018-11-07 16:44:23,266 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 245 transitions. Word has length 269 [2018-11-07 16:44:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:23,267 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 245 transitions. [2018-11-07 16:44:23,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 16:44:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 245 transitions. [2018-11-07 16:44:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-07 16:44:23,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:23,269 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:23,269 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:23,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:23,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1690169939, now seen corresponding path program 30 times [2018-11-07 16:44:23,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:23,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:23,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:23,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:23,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1155 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:44:24,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:24,538 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:24,538 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:24,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:24,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:24,538 INFO L194 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-07 16:44:24,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:24,552 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:24,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:24,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:24,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1155 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:44:25,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1155 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:44:26,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:26,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 68 [2018-11-07 16:44:26,275 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:26,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-07 16:44:26,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-07 16:44:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=3477, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 16:44:26,277 INFO L87 Difference]: Start difference. First operand 231 states and 245 transitions. Second operand 68 states. [2018-11-07 16:44:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:27,577 INFO L93 Difference]: Finished difference Result 461 states and 541 transitions. [2018-11-07 16:44:27,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 16:44:27,577 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 272 [2018-11-07 16:44:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:27,579 INFO L225 Difference]: With dead ends: 461 [2018-11-07 16:44:27,579 INFO L226 Difference]: Without dead ends: 344 [2018-11-07 16:44:27,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 480 SyntacticMatches, 43 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2113, Invalid=5897, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 16:44:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-07 16:44:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 234. [2018-11-07 16:44:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-07 16:44:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 248 transitions. [2018-11-07 16:44:27,598 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 248 transitions. Word has length 272 [2018-11-07 16:44:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:27,599 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 248 transitions. [2018-11-07 16:44:27,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-07 16:44:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 248 transitions. [2018-11-07 16:44:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 16:44:27,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:27,601 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:27,601 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:27,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash 306808457, now seen corresponding path program 31 times [2018-11-07 16:44:27,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:27,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:27,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 800 proven. 1174 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 16:44:28,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:28,069 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:28,069 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:28,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:28,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:28,070 INFO L194 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-07 16:44:28,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:28,086 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:28,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 801 proven. 1113 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:44:28,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2754 backedges. 801 proven. 1113 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:44:28,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:28,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 31 [2018-11-07 16:44:28,786 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:28,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 16:44:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 16:44:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=593, Unknown=0, NotChecked=0, Total=930 [2018-11-07 16:44:28,788 INFO L87 Difference]: Start difference. First operand 234 states and 248 transitions. Second operand 30 states. [2018-11-07 16:44:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:29,230 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2018-11-07 16:44:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 16:44:29,230 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 275 [2018-11-07 16:44:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:29,232 INFO L225 Difference]: With dead ends: 250 [2018-11-07 16:44:29,232 INFO L226 Difference]: Without dead ends: 248 [2018-11-07 16:44:29,232 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 528 SyntacticMatches, 43 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=706, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 16:44:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-07 16:44:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-11-07 16:44:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-07 16:44:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 263 transitions. [2018-11-07 16:44:29,248 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 263 transitions. Word has length 275 [2018-11-07 16:44:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:29,248 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 263 transitions. [2018-11-07 16:44:29,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 16:44:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 263 transitions. [2018-11-07 16:44:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-07 16:44:29,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:29,251 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:29,251 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:29,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:29,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2063423255, now seen corresponding path program 32 times [2018-11-07 16:44:29,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:29,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:29,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:29,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:29,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1380 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:44:30,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:30,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:30,248 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:30,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:30,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:30,249 INFO L194 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-07 16:44:30,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:30,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:30,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 16:44:30,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:30,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1380 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:44:31,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1380 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:44:32,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:32,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2018-11-07 16:44:32,300 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:32,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-07 16:44:32,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-07 16:44:32,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1323, Invalid=4227, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 16:44:32,301 INFO L87 Difference]: Start difference. First operand 248 states and 263 transitions. Second operand 73 states. [2018-11-07 16:44:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:33,699 INFO L93 Difference]: Finished difference Result 495 states and 579 transitions. [2018-11-07 16:44:33,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 16:44:33,699 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 293 [2018-11-07 16:44:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:33,701 INFO L225 Difference]: With dead ends: 495 [2018-11-07 16:44:33,701 INFO L226 Difference]: Without dead ends: 366 [2018-11-07 16:44:33,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 517 SyntacticMatches, 44 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3311 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 16:44:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-07 16:44:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 251. [2018-11-07 16:44:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-07 16:44:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 266 transitions. [2018-11-07 16:44:33,719 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 266 transitions. Word has length 293 [2018-11-07 16:44:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:33,720 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 266 transitions. [2018-11-07 16:44:33,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-07 16:44:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 266 transitions. [2018-11-07 16:44:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 16:44:33,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:33,722 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:33,722 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:33,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:33,723 INFO L82 PathProgramCache]: Analyzing trace with hash -759000691, now seen corresponding path program 33 times [2018-11-07 16:44:33,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:33,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:33,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:33,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:33,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1380 proven. 828 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:44:35,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:35,599 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:35,599 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:35,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:35,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:35,599 INFO L194 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-07 16:44:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:35,608 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:35,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:35,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:35,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1380 proven. 828 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:44:37,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1380 proven. 828 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:44:37,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:37,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 74 [2018-11-07 16:44:37,898 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:37,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-11-07 16:44:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-11-07 16:44:37,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 16:44:37,899 INFO L87 Difference]: Start difference. First operand 251 states and 266 transitions. Second operand 74 states. [2018-11-07 16:44:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:39,247 INFO L93 Difference]: Finished difference Result 501 states and 588 transitions. [2018-11-07 16:44:39,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 16:44:39,247 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 296 [2018-11-07 16:44:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:39,249 INFO L225 Difference]: With dead ends: 501 [2018-11-07 16:44:39,250 INFO L226 Difference]: Without dead ends: 374 [2018-11-07 16:44:39,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 522 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2497, Invalid=7009, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 16:44:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-07 16:44:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 254. [2018-11-07 16:44:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-07 16:44:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 269 transitions. [2018-11-07 16:44:39,269 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 269 transitions. Word has length 296 [2018-11-07 16:44:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:39,269 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 269 transitions. [2018-11-07 16:44:39,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-11-07 16:44:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 269 transitions. [2018-11-07 16:44:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-07 16:44:39,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:39,271 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:39,272 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:39,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1570490775, now seen corresponding path program 34 times [2018-11-07 16:44:39,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:39,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:39,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3292 backedges. 945 proven. 1401 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-11-07 16:44:40,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:40,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:40,077 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:40,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:40,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:40,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:40,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:40,086 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:40,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3292 backedges. 946 proven. 1334 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:44:40,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3292 backedges. 946 proven. 1334 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:44:40,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:40,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 33 [2018-11-07 16:44:40,854 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:40,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 16:44:40,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 16:44:40,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=666, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 16:44:40,854 INFO L87 Difference]: Start difference. First operand 254 states and 269 transitions. Second operand 32 states. [2018-11-07 16:44:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:41,330 INFO L93 Difference]: Finished difference Result 270 states and 286 transitions. [2018-11-07 16:44:41,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:44:41,331 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 299 [2018-11-07 16:44:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:41,333 INFO L225 Difference]: With dead ends: 270 [2018-11-07 16:44:41,333 INFO L226 Difference]: Without dead ends: 268 [2018-11-07 16:44:41,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 574 SyntacticMatches, 47 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 16:44:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-07 16:44:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-11-07 16:44:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-07 16:44:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 284 transitions. [2018-11-07 16:44:41,352 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 284 transitions. Word has length 299 [2018-11-07 16:44:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:41,352 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 284 transitions. [2018-11-07 16:44:41,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 16:44:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 284 transitions. [2018-11-07 16:44:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-07 16:44:41,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:41,355 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:41,355 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:41,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1887772873, now seen corresponding path program 35 times [2018-11-07 16:44:41,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:41,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:41,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:41,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:41,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1625 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:44:42,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:42,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:42,449 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:42,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:42,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:42,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:42,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:42,457 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:42,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 16:44:42,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:42,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1625 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:44:43,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1625 proven. 900 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:44:45,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:45,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2018-11-07 16:44:45,149 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:45,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-07 16:44:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-07 16:44:45,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1537, Invalid=4943, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 16:44:45,151 INFO L87 Difference]: Start difference. First operand 268 states and 284 transitions. Second operand 79 states. [2018-11-07 16:44:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:46,890 INFO L93 Difference]: Finished difference Result 535 states and 626 transitions. [2018-11-07 16:44:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 16:44:46,890 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 317 [2018-11-07 16:44:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:46,892 INFO L225 Difference]: With dead ends: 535 [2018-11-07 16:44:46,892 INFO L226 Difference]: Without dead ends: 396 [2018-11-07 16:44:46,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 559 SyntacticMatches, 48 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3899 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2912, Invalid=8218, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 16:44:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-07 16:44:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 271. [2018-11-07 16:44:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-07 16:44:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 287 transitions. [2018-11-07 16:44:46,910 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 287 transitions. Word has length 317 [2018-11-07 16:44:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:46,910 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 287 transitions. [2018-11-07 16:44:46,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-07 16:44:46,911 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 287 transitions. [2018-11-07 16:44:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-11-07 16:44:46,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:46,913 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:46,913 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:46,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1510056595, now seen corresponding path program 36 times [2018-11-07 16:44:46,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:46,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:46,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:46,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:46,915 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1625 proven. 975 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:44:48,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:48,584 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:48,584 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:48,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:48,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:48,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:48,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:48,594 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:48,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:48,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:48,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1625 proven. 975 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:44:50,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1625 proven. 975 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:44:51,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:51,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 80 [2018-11-07 16:44:51,100 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:51,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-11-07 16:44:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-11-07 16:44:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 16:44:51,101 INFO L87 Difference]: Start difference. First operand 271 states and 287 transitions. Second operand 80 states. [2018-11-07 16:44:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:52,940 INFO L93 Difference]: Finished difference Result 541 states and 635 transitions. [2018-11-07 16:44:52,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 16:44:52,940 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 320 [2018-11-07 16:44:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:52,943 INFO L225 Difference]: With dead ends: 541 [2018-11-07 16:44:52,943 INFO L226 Difference]: Without dead ends: 404 [2018-11-07 16:44:52,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 564 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2913, Invalid=8217, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 16:44:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-07 16:44:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 274. [2018-11-07 16:44:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-07 16:44:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 290 transitions. [2018-11-07 16:44:52,963 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 290 transitions. Word has length 320 [2018-11-07 16:44:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:52,964 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 290 transitions. [2018-11-07 16:44:52,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-11-07 16:44:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 290 transitions. [2018-11-07 16:44:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-07 16:44:52,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:52,966 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:52,966 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:52,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:52,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1836461641, now seen corresponding path program 37 times [2018-11-07 16:44:52,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:52,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:52,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1102 proven. 1648 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-07 16:44:53,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:53,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:53,702 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:53,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:53,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:53,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:53,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:53,711 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:53,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1103 proven. 1575 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:44:54,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1103 proven. 1575 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:44:55,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:55,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 35 [2018-11-07 16:44:55,807 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:55,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 16:44:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 16:44:55,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=743, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 16:44:55,808 INFO L87 Difference]: Start difference. First operand 274 states and 290 transitions. Second operand 34 states. [2018-11-07 16:44:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:56,172 INFO L93 Difference]: Finished difference Result 290 states and 307 transitions. [2018-11-07 16:44:56,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 16:44:56,173 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 323 [2018-11-07 16:44:56,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:56,175 INFO L225 Difference]: With dead ends: 290 [2018-11-07 16:44:56,175 INFO L226 Difference]: Without dead ends: 288 [2018-11-07 16:44:56,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 620 SyntacticMatches, 51 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=460, Invalid=872, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 16:44:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-07 16:44:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-11-07 16:44:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-07 16:44:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 305 transitions. [2018-11-07 16:44:56,190 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 305 transitions. Word has length 323 [2018-11-07 16:44:56,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:56,191 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 305 transitions. [2018-11-07 16:44:56,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 16:44:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 305 transitions. [2018-11-07 16:44:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-07 16:44:56,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:56,193 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:56,194 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:56,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:56,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1388109993, now seen corresponding path program 38 times [2018-11-07 16:44:56,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:56,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:56,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:56,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:56,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1890 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:44:58,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:58,020 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:58,020 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:58,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:58,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:58,020 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:58,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:58,029 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:58,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-07 16:44:58,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:58,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1890 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:44:59,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1890 proven. 1053 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:45:01,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:01,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2018-11-07 16:45:01,276 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:01,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-07 16:45:01,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-07 16:45:01,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=5715, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 16:45:01,277 INFO L87 Difference]: Start difference. First operand 288 states and 305 transitions. Second operand 85 states. [2018-11-07 16:45:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:02,854 INFO L93 Difference]: Finished difference Result 575 states and 673 transitions. [2018-11-07 16:45:02,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 16:45:02,854 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 341 [2018-11-07 16:45:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:02,857 INFO L225 Difference]: With dead ends: 575 [2018-11-07 16:45:02,857 INFO L226 Difference]: Without dead ends: 426 [2018-11-07 16:45:02,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 601 SyntacticMatches, 52 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4535 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3360, Invalid=9522, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 16:45:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-07 16:45:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 291. [2018-11-07 16:45:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-07 16:45:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 308 transitions. [2018-11-07 16:45:02,878 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 308 transitions. Word has length 341 [2018-11-07 16:45:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:02,879 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 308 transitions. [2018-11-07 16:45:02,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-07 16:45:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 308 transitions. [2018-11-07 16:45:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-07 16:45:02,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:02,881 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:02,882 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:02,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:02,882 INFO L82 PathProgramCache]: Analyzing trace with hash -298618547, now seen corresponding path program 39 times [2018-11-07 16:45:02,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:02,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:02,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:02,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:02,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4428 backedges. 1890 proven. 1134 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:45:04,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:04,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:04,800 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:04,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:04,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:04,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:04,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:04,810 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:04,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:04,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:04,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4428 backedges. 1890 proven. 1134 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:45:06,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4428 backedges. 1890 proven. 1134 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:45:08,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:08,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 86 [2018-11-07 16:45:08,275 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:08,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-11-07 16:45:08,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-11-07 16:45:08,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 16:45:08,276 INFO L87 Difference]: Start difference. First operand 291 states and 308 transitions. Second operand 86 states. [2018-11-07 16:45:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:10,067 INFO L93 Difference]: Finished difference Result 581 states and 682 transitions. [2018-11-07 16:45:10,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 16:45:10,067 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 344 [2018-11-07 16:45:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:10,069 INFO L225 Difference]: With dead ends: 581 [2018-11-07 16:45:10,069 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 16:45:10,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 606 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3361, Invalid=9521, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 16:45:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 16:45:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 294. [2018-11-07 16:45:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-07 16:45:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 311 transitions. [2018-11-07 16:45:10,090 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 311 transitions. Word has length 344 [2018-11-07 16:45:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:10,090 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 311 transitions. [2018-11-07 16:45:10,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-11-07 16:45:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 311 transitions. [2018-11-07 16:45:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-07 16:45:10,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:10,093 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:10,093 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:10,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:10,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1488809513, now seen corresponding path program 40 times [2018-11-07 16:45:10,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:10,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:10,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:10,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:10,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1271 proven. 1915 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-11-07 16:45:11,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:11,070 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:11,070 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:11,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:11,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:11,070 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:11,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:11,078 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:11,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1272 proven. 1836 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:45:11,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1272 proven. 1836 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:45:12,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:12,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 37 [2018-11-07 16:45:12,042 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:12,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 16:45:12,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 16:45:12,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=824, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 16:45:12,043 INFO L87 Difference]: Start difference. First operand 294 states and 311 transitions. Second operand 36 states. [2018-11-07 16:45:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:12,454 INFO L93 Difference]: Finished difference Result 310 states and 328 transitions. [2018-11-07 16:45:12,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 16:45:12,455 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 347 [2018-11-07 16:45:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:12,457 INFO L225 Difference]: With dead ends: 310 [2018-11-07 16:45:12,457 INFO L226 Difference]: Without dead ends: 308 [2018-11-07 16:45:12,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 666 SyntacticMatches, 55 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=521, Invalid=961, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:45:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-07 16:45:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-11-07 16:45:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-07 16:45:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2018-11-07 16:45:12,476 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 347 [2018-11-07 16:45:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:12,476 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2018-11-07 16:45:12,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 16:45:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2018-11-07 16:45:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-07 16:45:12,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:12,478 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:12,478 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:12,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2103961737, now seen corresponding path program 41 times [2018-11-07 16:45:12,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:12,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:12,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:12,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:12,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 2175 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:45:13,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:13,834 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:13,834 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:13,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:13,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:13,834 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:13,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:13,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:13,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 16:45:13,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:13,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 2175 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:45:15,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 2175 proven. 1218 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:45:17,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:17,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2018-11-07 16:45:17,049 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:17,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-11-07 16:45:17,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-11-07 16:45:17,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2013, Invalid=6543, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 16:45:17,050 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 91 states. [2018-11-07 16:45:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:18,828 INFO L93 Difference]: Finished difference Result 615 states and 720 transitions. [2018-11-07 16:45:18,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 16:45:18,829 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 365 [2018-11-07 16:45:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:18,831 INFO L225 Difference]: With dead ends: 615 [2018-11-07 16:45:18,831 INFO L226 Difference]: Without dead ends: 456 [2018-11-07 16:45:18,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 643 SyntacticMatches, 56 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5219 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3840, Invalid=10922, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 16:45:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-11-07 16:45:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 311. [2018-11-07 16:45:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-07 16:45:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 329 transitions. [2018-11-07 16:45:18,853 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 329 transitions. Word has length 365 [2018-11-07 16:45:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:18,854 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 329 transitions. [2018-11-07 16:45:18,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-11-07 16:45:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 329 transitions. [2018-11-07 16:45:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-11-07 16:45:18,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:18,856 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:18,856 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:18,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1897909549, now seen corresponding path program 42 times [2018-11-07 16:45:18,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:18,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:18,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:18,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:18,858 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 2175 proven. 1305 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:45:20,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:20,267 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:20,267 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:20,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:20,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:20,267 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:20,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:20,275 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:20,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:20,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:20,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 2175 proven. 1305 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:45:22,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5104 backedges. 2175 proven. 1305 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:45:23,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:23,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 92 [2018-11-07 16:45:23,268 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:23,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-11-07 16:45:23,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-11-07 16:45:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 16:45:23,270 INFO L87 Difference]: Start difference. First operand 311 states and 329 transitions. Second operand 92 states. [2018-11-07 16:45:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:25,231 INFO L93 Difference]: Finished difference Result 621 states and 729 transitions. [2018-11-07 16:45:25,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 16:45:25,232 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 368 [2018-11-07 16:45:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:25,234 INFO L225 Difference]: With dead ends: 621 [2018-11-07 16:45:25,234 INFO L226 Difference]: Without dead ends: 464 [2018-11-07 16:45:25,235 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 648 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3841, Invalid=10921, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 16:45:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-11-07 16:45:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 314. [2018-11-07 16:45:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-07 16:45:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 332 transitions. [2018-11-07 16:45:25,257 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 332 transitions. Word has length 368 [2018-11-07 16:45:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:25,257 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 332 transitions. [2018-11-07 16:45:25,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-11-07 16:45:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 332 transitions. [2018-11-07 16:45:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-11-07 16:45:25,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:25,260 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:25,260 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:25,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:25,261 INFO L82 PathProgramCache]: Analyzing trace with hash 905442825, now seen corresponding path program 43 times [2018-11-07 16:45:25,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:25,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:25,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:25,262 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 1452 proven. 2202 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-11-07 16:45:26,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:26,344 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:26,344 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:26,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:26,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:26,345 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:26,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:26,355 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:26,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 1453 proven. 2117 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:45:26,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 1453 proven. 2117 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:45:27,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:27,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 39 [2018-11-07 16:45:27,589 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:27,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 16:45:27,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 16:45:27,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:45:27,590 INFO L87 Difference]: Start difference. First operand 314 states and 332 transitions. Second operand 38 states. [2018-11-07 16:45:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:27,958 INFO L93 Difference]: Finished difference Result 330 states and 349 transitions. [2018-11-07 16:45:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 16:45:27,958 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 371 [2018-11-07 16:45:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:27,960 INFO L225 Difference]: With dead ends: 330 [2018-11-07 16:45:27,961 INFO L226 Difference]: Without dead ends: 328 [2018-11-07 16:45:27,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 712 SyntacticMatches, 59 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=586, Invalid=1054, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 16:45:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-07 16:45:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-07 16:45:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-07 16:45:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 347 transitions. [2018-11-07 16:45:27,981 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 347 transitions. Word has length 371 [2018-11-07 16:45:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:27,981 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 347 transitions. [2018-11-07 16:45:27,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 16:45:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 347 transitions. [2018-11-07 16:45:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-11-07 16:45:27,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:27,984 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:27,984 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:27,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 247740521, now seen corresponding path program 44 times [2018-11-07 16:45:27,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:27,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:27,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:27,986 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 2480 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:45:29,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:29,851 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:29,851 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:29,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:29,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:29,852 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:29,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:29,860 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:30,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 16:45:30,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:30,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 2480 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:45:31,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 2480 proven. 1395 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:45:33,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:33,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2018-11-07 16:45:33,366 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:33,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 16:45:33,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 16:45:33,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2275, Invalid=7427, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 16:45:33,367 INFO L87 Difference]: Start difference. First operand 328 states and 347 transitions. Second operand 97 states. [2018-11-07 16:45:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:39,938 INFO L93 Difference]: Finished difference Result 655 states and 767 transitions. [2018-11-07 16:45:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-07 16:45:39,939 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 389 [2018-11-07 16:45:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:39,941 INFO L225 Difference]: With dead ends: 655 [2018-11-07 16:45:39,941 INFO L226 Difference]: Without dead ends: 486 [2018-11-07 16:45:39,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 685 SyntacticMatches, 60 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5951 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4352, Invalid=12418, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 16:45:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-07 16:45:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 331. [2018-11-07 16:45:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-07 16:45:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 350 transitions. [2018-11-07 16:45:39,966 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 350 transitions. Word has length 389 [2018-11-07 16:45:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:39,966 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 350 transitions. [2018-11-07 16:45:39,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 16:45:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 350 transitions. [2018-11-07 16:45:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-11-07 16:45:39,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:39,969 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:39,969 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:39,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:39,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1056870131, now seen corresponding path program 45 times [2018-11-07 16:45:39,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:39,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:39,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:39,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5828 backedges. 2480 proven. 1488 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:45:41,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:41,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:41,828 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:41,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:41,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:41,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:41,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:41,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:41,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:41,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:41,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5828 backedges. 2480 proven. 1488 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:45:43,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5828 backedges. 2480 proven. 1488 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:45:45,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:45,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 98 [2018-11-07 16:45:45,039 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:45,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-07 16:45:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-07 16:45:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2209, Invalid=7297, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 16:45:45,041 INFO L87 Difference]: Start difference. First operand 331 states and 350 transitions. Second operand 98 states. [2018-11-07 16:45:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:47,382 INFO L93 Difference]: Finished difference Result 661 states and 776 transitions. [2018-11-07 16:45:47,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-07 16:45:47,383 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 392 [2018-11-07 16:45:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:47,385 INFO L225 Difference]: With dead ends: 661 [2018-11-07 16:45:47,385 INFO L226 Difference]: Without dead ends: 494 [2018-11-07 16:45:47,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 690 SyntacticMatches, 63 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4353, Invalid=12417, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 16:45:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-11-07 16:45:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 334. [2018-11-07 16:45:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-07 16:45:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 353 transitions. [2018-11-07 16:45:47,409 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 353 transitions. Word has length 392 [2018-11-07 16:45:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:47,409 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 353 transitions. [2018-11-07 16:45:47,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-11-07 16:45:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 353 transitions. [2018-11-07 16:45:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-07 16:45:47,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:47,411 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:47,412 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:47,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1553742359, now seen corresponding path program 46 times [2018-11-07 16:45:47,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:47,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:47,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:47,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:47,413 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 1645 proven. 2509 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-11-07 16:45:48,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:48,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:48,200 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:48,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:48,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:48,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:48,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:48,208 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:48,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 1646 proven. 2418 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:45:48,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 1646 proven. 2418 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:45:49,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:49,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 41 [2018-11-07 16:45:49,444 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:49,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 16:45:49,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 16:45:49,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=998, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 16:45:49,445 INFO L87 Difference]: Start difference. First operand 334 states and 353 transitions. Second operand 40 states. [2018-11-07 16:45:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:49,891 INFO L93 Difference]: Finished difference Result 350 states and 370 transitions. [2018-11-07 16:45:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:45:49,892 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 395 [2018-11-07 16:45:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:49,894 INFO L225 Difference]: With dead ends: 350 [2018-11-07 16:45:49,894 INFO L226 Difference]: Without dead ends: 348 [2018-11-07 16:45:49,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 758 SyntacticMatches, 63 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 16:45:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-07 16:45:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-11-07 16:45:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-11-07 16:45:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 368 transitions. [2018-11-07 16:45:49,914 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 368 transitions. Word has length 395 [2018-11-07 16:45:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:49,914 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 368 transitions. [2018-11-07 16:45:49,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 16:45:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 368 transitions. [2018-11-07 16:45:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-07 16:45:49,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:49,917 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:49,917 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:49,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash -779104183, now seen corresponding path program 47 times [2018-11-07 16:45:49,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:49,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:49,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2805 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:45:51,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:51,797 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:51,797 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:51,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:51,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:51,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:51,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:51,807 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:51,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-07 16:45:51,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:52,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2805 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:45:53,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2805 proven. 1584 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:45:55,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:55,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2018-11-07 16:45:55,486 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:55,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-11-07 16:45:55,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-11-07 16:45:55,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2553, Invalid=8367, Unknown=0, NotChecked=0, Total=10920 [2018-11-07 16:45:55,488 INFO L87 Difference]: Start difference. First operand 348 states and 368 transitions. Second operand 103 states. [2018-11-07 16:45:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:58,237 INFO L93 Difference]: Finished difference Result 695 states and 814 transitions. [2018-11-07 16:45:58,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-07 16:45:58,237 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 413 [2018-11-07 16:45:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:58,239 INFO L225 Difference]: With dead ends: 695 [2018-11-07 16:45:58,239 INFO L226 Difference]: Without dead ends: 516 [2018-11-07 16:45:58,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 727 SyntacticMatches, 64 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6731 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4896, Invalid=14010, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 16:45:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-11-07 16:45:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 351. [2018-11-07 16:45:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-07 16:45:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 371 transitions. [2018-11-07 16:45:58,259 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 371 transitions. Word has length 413 [2018-11-07 16:45:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:58,260 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 371 transitions. [2018-11-07 16:45:58,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-11-07 16:45:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 371 transitions. [2018-11-07 16:45:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-11-07 16:45:58,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:58,263 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:58,263 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:58,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:58,263 INFO L82 PathProgramCache]: Analyzing trace with hash 479616237, now seen corresponding path program 48 times [2018-11-07 16:45:58,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:58,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:58,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:58,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:58,264 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 2805 proven. 1683 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:45:59,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:59,895 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:59,895 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:59,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:59,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:59,896 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:59,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:59,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:00,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:00,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:00,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 2805 proven. 1683 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:46:02,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6600 backedges. 2805 proven. 1683 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:46:03,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:03,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 104 [2018-11-07 16:46:03,697 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:03,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-11-07 16:46:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-11-07 16:46:03,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2483, Invalid=8229, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 16:46:03,698 INFO L87 Difference]: Start difference. First operand 351 states and 371 transitions. Second operand 104 states. [2018-11-07 16:46:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:06,280 INFO L93 Difference]: Finished difference Result 701 states and 823 transitions. [2018-11-07 16:46:06,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 16:46:06,280 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 416 [2018-11-07 16:46:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:06,283 INFO L225 Difference]: With dead ends: 701 [2018-11-07 16:46:06,283 INFO L226 Difference]: Without dead ends: 524 [2018-11-07 16:46:06,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 732 SyntacticMatches, 67 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6666 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4897, Invalid=14009, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 16:46:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-11-07 16:46:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 354. [2018-11-07 16:46:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-11-07 16:46:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 374 transitions. [2018-11-07 16:46:06,312 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 374 transitions. Word has length 416 [2018-11-07 16:46:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:06,312 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 374 transitions. [2018-11-07 16:46:06,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-11-07 16:46:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 374 transitions. [2018-11-07 16:46:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-07 16:46:06,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:06,316 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:06,316 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:06,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash -339812919, now seen corresponding path program 49 times [2018-11-07 16:46:06,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:06,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:06,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6702 backedges. 1850 proven. 2836 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-11-07 16:46:07,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:07,366 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:07,367 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:07,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:07,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:07,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:07,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:07,376 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:07,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6702 backedges. 1851 proven. 2739 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:46:07,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6702 backedges. 1851 proven. 2739 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:46:08,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:08,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 43 [2018-11-07 16:46:08,700 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:08,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 16:46:08,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 16:46:08,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1091, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 16:46:08,701 INFO L87 Difference]: Start difference. First operand 354 states and 374 transitions. Second operand 42 states. [2018-11-07 16:46:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:09,252 INFO L93 Difference]: Finished difference Result 370 states and 391 transitions. [2018-11-07 16:46:09,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 16:46:09,252 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 419 [2018-11-07 16:46:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:09,255 INFO L225 Difference]: With dead ends: 370 [2018-11-07 16:46:09,255 INFO L226 Difference]: Without dead ends: 368 [2018-11-07 16:46:09,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 804 SyntacticMatches, 67 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1501 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=728, Invalid=1252, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:46:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-11-07 16:46:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-11-07 16:46:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-07 16:46:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 389 transitions. [2018-11-07 16:46:09,275 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 389 transitions. Word has length 419 [2018-11-07 16:46:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:09,275 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 389 transitions. [2018-11-07 16:46:09,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 16:46:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 389 transitions. [2018-11-07 16:46:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-11-07 16:46:09,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:09,278 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:09,278 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:09,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash 487108649, now seen corresponding path program 50 times [2018-11-07 16:46:09,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:09,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:09,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:09,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:09,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 3150 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:46:11,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:11,070 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:11,070 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:11,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:11,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:11,070 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:11,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:11,080 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:11,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 16:46:11,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:11,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 3150 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:46:13,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 3150 proven. 1785 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:46:15,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:15,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2018-11-07 16:46:15,371 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:15,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-11-07 16:46:15,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-11-07 16:46:15,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2847, Invalid=9363, Unknown=0, NotChecked=0, Total=12210 [2018-11-07 16:46:15,373 INFO L87 Difference]: Start difference. First operand 368 states and 389 transitions. Second operand 109 states. [2018-11-07 16:46:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:18,254 INFO L93 Difference]: Finished difference Result 735 states and 861 transitions. [2018-11-07 16:46:18,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 16:46:18,255 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 437 [2018-11-07 16:46:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:18,257 INFO L225 Difference]: With dead ends: 735 [2018-11-07 16:46:18,257 INFO L226 Difference]: Without dead ends: 546 [2018-11-07 16:46:18,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 769 SyntacticMatches, 68 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7559 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5472, Invalid=15698, Unknown=0, NotChecked=0, Total=21170 [2018-11-07 16:46:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-07 16:46:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 371. [2018-11-07 16:46:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-07 16:46:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 392 transitions. [2018-11-07 16:46:18,281 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 392 transitions. Word has length 437 [2018-11-07 16:46:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:18,281 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 392 transitions. [2018-11-07 16:46:18,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-11-07 16:46:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 392 transitions. [2018-11-07 16:46:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-11-07 16:46:18,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:18,284 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:18,284 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:18,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1327272141, now seen corresponding path program 51 times [2018-11-07 16:46:18,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:18,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:18,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7420 backedges. 3150 proven. 1890 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:46:20,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:20,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:20,249 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:20,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:20,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:20,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:20,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:20,257 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:20,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:20,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:20,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7420 backedges. 3150 proven. 1890 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:46:22,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7420 backedges. 3150 proven. 1890 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:46:24,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:24,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 110 [2018-11-07 16:46:24,698 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:24,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-11-07 16:46:24,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-11-07 16:46:24,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2773, Invalid=9217, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 16:46:24,700 INFO L87 Difference]: Start difference. First operand 371 states and 392 transitions. Second operand 110 states. [2018-11-07 16:46:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:27,713 INFO L93 Difference]: Finished difference Result 741 states and 870 transitions. [2018-11-07 16:46:27,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-07 16:46:27,714 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 440 [2018-11-07 16:46:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:27,717 INFO L225 Difference]: With dead ends: 741 [2018-11-07 16:46:27,717 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 16:46:27,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 989 GetRequests, 774 SyntacticMatches, 71 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7490 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5473, Invalid=15697, Unknown=0, NotChecked=0, Total=21170 [2018-11-07 16:46:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 16:46:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 374. [2018-11-07 16:46:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-07 16:46:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 395 transitions. [2018-11-07 16:46:27,740 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 395 transitions. Word has length 440 [2018-11-07 16:46:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:27,740 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 395 transitions. [2018-11-07 16:46:27,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-11-07 16:46:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 395 transitions. [2018-11-07 16:46:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-11-07 16:46:27,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:27,743 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:27,743 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:27,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash -431538775, now seen corresponding path program 52 times [2018-11-07 16:46:27,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:27,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:27,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2067 proven. 3183 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-11-07 16:46:28,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:28,880 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:28,880 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:28,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:28,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:28,881 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:28,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:28,890 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:29,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2068 proven. 3080 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:46:29,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 2068 proven. 3080 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:46:30,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:30,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 45 [2018-11-07 16:46:30,366 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:30,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 16:46:30,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 16:46:30,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=1188, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:46:30,367 INFO L87 Difference]: Start difference. First operand 374 states and 395 transitions. Second operand 44 states. [2018-11-07 16:46:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:30,987 INFO L93 Difference]: Finished difference Result 390 states and 412 transitions. [2018-11-07 16:46:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:46:30,988 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 443 [2018-11-07 16:46:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:30,990 INFO L225 Difference]: With dead ends: 390 [2018-11-07 16:46:30,990 INFO L226 Difference]: Without dead ends: 388 [2018-11-07 16:46:30,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 850 SyntacticMatches, 71 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=805, Invalid=1357, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 16:46:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-07 16:46:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-11-07 16:46:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-07 16:46:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 410 transitions. [2018-11-07 16:46:31,010 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 410 transitions. Word has length 443 [2018-11-07 16:46:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:31,010 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 410 transitions. [2018-11-07 16:46:31,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 16:46:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 410 transitions. [2018-11-07 16:46:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-11-07 16:46:31,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:31,013 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:31,013 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:31,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1259546615, now seen corresponding path program 53 times [2018-11-07 16:46:31,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:31,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:31,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:31,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:31,015 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 3515 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:46:33,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:33,237 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:33,237 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:33,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:33,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:33,237 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:33,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:33,246 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:33,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 16:46:33,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:33,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 3515 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:46:35,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 3515 proven. 1998 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:46:38,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:38,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2018-11-07 16:46:38,194 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:38,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-11-07 16:46:38,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-11-07 16:46:38,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3157, Invalid=10415, Unknown=0, NotChecked=0, Total=13572 [2018-11-07 16:46:38,196 INFO L87 Difference]: Start difference. First operand 388 states and 410 transitions. Second operand 115 states. [2018-11-07 16:46:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:42,576 INFO L93 Difference]: Finished difference Result 775 states and 908 transitions. [2018-11-07 16:46:42,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-11-07 16:46:42,577 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 461 [2018-11-07 16:46:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:42,579 INFO L225 Difference]: With dead ends: 775 [2018-11-07 16:46:42,579 INFO L226 Difference]: Without dead ends: 576 [2018-11-07 16:46:42,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 811 SyntacticMatches, 72 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8435 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=6080, Invalid=17482, Unknown=0, NotChecked=0, Total=23562 [2018-11-07 16:46:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-11-07 16:46:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 391. [2018-11-07 16:46:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-11-07 16:46:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 413 transitions. [2018-11-07 16:46:42,604 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 413 transitions. Word has length 461 [2018-11-07 16:46:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:42,604 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 413 transitions. [2018-11-07 16:46:42,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-11-07 16:46:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 413 transitions. [2018-11-07 16:46:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-11-07 16:46:42,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:42,607 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:42,607 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:42,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1873670995, now seen corresponding path program 54 times [2018-11-07 16:46:42,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:42,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:42,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8288 backedges. 3515 proven. 2109 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:46:44,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:44,507 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:44,507 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:44,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:44,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:44,508 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:44,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:44,518 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:44,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:44,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:44,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8288 backedges. 3515 proven. 2109 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:46:47,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8288 backedges. 3515 proven. 2109 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:46:49,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:49,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 116 [2018-11-07 16:46:49,226 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:49,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-11-07 16:46:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-11-07 16:46:49,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=10261, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 16:46:49,228 INFO L87 Difference]: Start difference. First operand 391 states and 413 transitions. Second operand 116 states. [2018-11-07 16:46:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:52,175 INFO L93 Difference]: Finished difference Result 781 states and 917 transitions. [2018-11-07 16:46:52,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-11-07 16:46:52,175 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 464 [2018-11-07 16:46:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:52,177 INFO L225 Difference]: With dead ends: 781 [2018-11-07 16:46:52,177 INFO L226 Difference]: Without dead ends: 584 [2018-11-07 16:46:52,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1043 GetRequests, 816 SyntacticMatches, 75 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8362 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=6081, Invalid=17481, Unknown=0, NotChecked=0, Total=23562 [2018-11-07 16:46:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-11-07 16:46:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 394. [2018-11-07 16:46:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-07 16:46:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 416 transitions. [2018-11-07 16:46:52,200 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 416 transitions. Word has length 464 [2018-11-07 16:46:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:52,200 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 416 transitions. [2018-11-07 16:46:52,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-11-07 16:46:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 416 transitions. [2018-11-07 16:46:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-11-07 16:46:52,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:52,202 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:52,202 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:52,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash -692394615, now seen corresponding path program 55 times [2018-11-07 16:46:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:52,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:52,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:52,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8402 backedges. 2296 proven. 3550 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-11-07 16:46:53,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:53,391 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:53,391 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:53,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:53,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:53,392 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:53,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:53,401 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:53,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8402 backedges. 2297 proven. 3441 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:46:53,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8402 backedges. 2297 proven. 3441 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:46:55,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:55,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 47 [2018-11-07 16:46:55,004 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:55,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 16:46:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 16:46:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=873, Invalid=1289, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 16:46:55,005 INFO L87 Difference]: Start difference. First operand 394 states and 416 transitions. Second operand 46 states. [2018-11-07 16:46:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:55,607 INFO L93 Difference]: Finished difference Result 410 states and 433 transitions. [2018-11-07 16:46:55,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 16:46:55,607 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 467 [2018-11-07 16:46:55,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:55,610 INFO L225 Difference]: With dead ends: 410 [2018-11-07 16:46:55,610 INFO L226 Difference]: Without dead ends: 408 [2018-11-07 16:46:55,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 896 SyntacticMatches, 75 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=886, Invalid=1466, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 16:46:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-11-07 16:46:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-11-07 16:46:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-11-07 16:46:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 431 transitions. [2018-11-07 16:46:55,632 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 431 transitions. Word has length 467 [2018-11-07 16:46:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:55,633 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 431 transitions. [2018-11-07 16:46:55,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 16:46:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 431 transitions. [2018-11-07 16:46:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-07 16:46:55,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:55,635 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:55,635 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:55,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1451603991, now seen corresponding path program 56 times [2018-11-07 16:46:55,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:55,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:55,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3900 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 16:46:58,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:58,277 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:58,277 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:58,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:58,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:58,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:58,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:58,287 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:58,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-07 16:46:58,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:58,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3900 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 16:47:01,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 3900 proven. 2223 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-07 16:47:03,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:03,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2018-11-07 16:47:03,511 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:03,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-11-07 16:47:03,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-11-07 16:47:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=11523, Unknown=0, NotChecked=0, Total=15006 [2018-11-07 16:47:03,513 INFO L87 Difference]: Start difference. First operand 408 states and 431 transitions. Second operand 121 states. Received shutdown request... [2018-11-07 16:47:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:47:03,948 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:47:03,953 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:47:03,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:47:03 BoogieIcfgContainer [2018-11-07 16:47:03,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:47:03,954 INFO L168 Benchmark]: Toolchain (without parser) took 225358.89 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -904.3 MB). Peak memory consumption was 318.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:47:03,955 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:47:03,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.42 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-07 16:47:03,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.29 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-07 16:47:03,956 INFO L168 Benchmark]: Boogie Preprocessor took 26.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-07 16:47:03,957 INFO L168 Benchmark]: RCFGBuilder took 538.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 16:47:03,957 INFO L168 Benchmark]: TraceAbstraction took 224446.98 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 478.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -123.8 MB). Peak memory consumption was 354.9 MB. Max. memory is 7.1 GB. [2018-11-07 16:47:03,960 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 323.42 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 19.29 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 26.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 538.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224446.98 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 478.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -123.8 MB). Peak memory consumption was 354.9 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 constructing difference of abstraction (408states) and FLOYD_HOARE automaton (currently 18 states, 121 states before enhancement),while ReachableStatesComputation was computing reachable states (122 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. TIMEOUT Result, 224.3s OverallTime, 59 OverallIterations, 40 TraceHistogramMax, 68.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4640 SDtfs, 9552 SDslu, 45637 SDs, 0 SdLazy, 36406 SolverSat, 5324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32388 GetRequests, 26432 SyntacticMatches, 2237 SemanticMatches, 3719 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134888 ImplicationChecksByTransitivity, 145.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 58 MinimizatonAttempts, 3710 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 142.1s InterpolantComputationTime, 29161 NumberOfCodeBlocks, 29161 NumberOfCodeBlocksAsserted, 531 NumberOfCheckSat, 43538 ConstructedInterpolants, 0 QuantifiedInterpolants, 42473608 SizeOfPredicates, 150 NumberOfNonLiveVariables, 35027 ConjunctsInSsa, 2516 ConjunctsInUnsatCore, 171 InterpolantComputations, 3 PerfectInterpolantSequences, 368269/527315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown