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-lit/gj2007_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:46:06,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:46:06,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:46:06,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:46:06,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:46:06,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:46:06,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:46:06,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:46:06,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:46:06,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:46:06,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:46:06,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:46:06,928 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:46:06,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:46:06,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:46:06,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:46:06,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:46:06,936 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:46:06,938 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:46:06,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:46:06,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:46:06,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:46:06,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:46:06,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:46:06,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:46:06,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:46:06,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:46:06,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:46:06,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:46:06,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:46:06,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:46:06,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:46:06,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:46:06,949 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:46:06,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:46:06,951 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:46:06,951 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:46:06,975 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:46:06,975 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:46:06,976 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:46:06,976 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:46:06,976 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:46:06,976 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:46:06,977 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:46:06,977 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:46:06,977 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:46:06,977 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:46:06,977 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:46:06,978 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:46:06,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:46:06,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:46:06,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:46:06,979 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:46:06,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:46:06,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:46:06,980 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:46:06,980 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:46:06,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:46:06,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:46:06,981 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:46:06,981 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:46:06,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:46:06,981 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:46:06,981 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:46:06,982 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:46:06,982 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:46:06,982 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:46:06,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:46:06,982 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:46:06,982 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:46:06,983 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:46:07,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:46:07,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:46:07,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:46:07,071 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:46:07,072 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:46:07,072 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2018-11-07 16:46:07,145 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49db84f4/38d09457b5d34d339ddcbed9ea8d292a/FLAGe6ea20794 [2018-11-07 16:46:07,570 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:46:07,571 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2018-11-07 16:46:07,578 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49db84f4/38d09457b5d34d339ddcbed9ea8d292a/FLAGe6ea20794 [2018-11-07 16:46:07,600 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49db84f4/38d09457b5d34d339ddcbed9ea8d292a [2018-11-07 16:46:07,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:46:07,612 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:46:07,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:46:07,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:46:07,617 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:46:07,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:46:07" (1/1) ... [2018-11-07 16:46:07,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3d082c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07, skipping insertion in model container [2018-11-07 16:46:07,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:46:07" (1/1) ... [2018-11-07 16:46:07,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:46:07,655 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:46:07,874 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:46:07,879 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:46:07,899 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:46:07,917 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:46:07,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07 WrapperNode [2018-11-07 16:46:07,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:46:07,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:46:07,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:46:07,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:46:07,930 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:46:07" (1/1) ... [2018-11-07 16:46:07,937 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:46:07" (1/1) ... [2018-11-07 16:46:07,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:46:07,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:46:07,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:46:07,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:46:07,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07" (1/1) ... [2018-11-07 16:46:07,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07" (1/1) ... [2018-11-07 16:46:07,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07" (1/1) ... [2018-11-07 16:46:07,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07" (1/1) ... [2018-11-07 16:46:07,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07" (1/1) ... [2018-11-07 16:46:07,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07" (1/1) ... [2018-11-07 16:46:07,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07" (1/1) ... [2018-11-07 16:46:07,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:46:07,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:46:07,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:46:07,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:46:07,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07" (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:46:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:46:08,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:46:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:46:08,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:46:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:46:08,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:46:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:46:08,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:46:08,338 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:46:08,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:46:08 BoogieIcfgContainer [2018-11-07 16:46:08,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:46:08,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:46:08,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:46:08,345 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:46:08,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:46:07" (1/3) ... [2018-11-07 16:46:08,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc9ff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:46:08, skipping insertion in model container [2018-11-07 16:46:08,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:07" (2/3) ... [2018-11-07 16:46:08,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc9ff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:46:08, skipping insertion in model container [2018-11-07 16:46:08,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:46:08" (3/3) ... [2018-11-07 16:46:08,349 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call_true-termination.c.i [2018-11-07 16:46:08,359 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:46:08,367 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:46:08,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:46:08,429 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:46:08,429 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:46:08,429 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:46:08,429 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:46:08,430 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:46:08,430 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:46:08,430 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:46:08,430 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:46:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 16:46:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:46:08,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:08,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:08,472 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:08,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:08,481 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-07 16:46:08,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:08,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:08,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:08,593 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:46:08,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:46:08,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:46:08,597 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:46:08,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:46:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:46:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:46:08,620 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 16:46:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:08,643 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-07 16:46:08,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:46:08,645 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:46:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:08,656 INFO L225 Difference]: With dead ends: 32 [2018-11-07 16:46:08,657 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 16:46:08,660 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:46:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 16:46:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 16:46:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 16:46:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-07 16:46:08,701 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-07 16:46:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:08,701 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-07 16:46:08,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:46:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-07 16:46:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:46:08,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:08,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:08,703 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:08,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-07 16:46:08,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:08,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:08,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:08,802 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:46:08,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:46:08,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:46:08,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:46:08,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:46:08,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:46:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:46:08,807 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-07 16:46:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:08,892 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-07 16:46:08,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:46:08,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 16:46:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:08,894 INFO L225 Difference]: With dead ends: 24 [2018-11-07 16:46:08,894 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 16:46:08,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:46:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 16:46:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 16:46:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 16:46:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-07 16:46:08,900 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-07 16:46:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:08,901 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-07 16:46:08,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:46:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-07 16:46:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 16:46:08,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:08,902 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:08,902 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:08,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash 64649018, now seen corresponding path program 1 times [2018-11-07 16:46:08,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:08,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:08,905 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:08,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:08,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:08,998 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 16:46:09,000 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 16:46:09,033 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:46:09,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:46:09,177 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 16:46:09,178 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 16:46:09,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:09,211 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 16:46:09,266 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-11-07 16:46:09,266 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 16:46:09,282 INFO L415 sIntCurrentIteration]: We unified 13 AI predicates to 13 [2018-11-07 16:46:09,282 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 16:46:09,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:46:09,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-07 16:46:09,284 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:46:09,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:46:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:46:09,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:46:09,285 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-07 16:46:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:09,361 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-07 16:46:09,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:46:09,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-07 16:46:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:09,362 INFO L225 Difference]: With dead ends: 24 [2018-11-07 16:46:09,362 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 16:46:09,363 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:46:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 16:46:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 16:46:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 16:46:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-07 16:46:09,368 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2018-11-07 16:46:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:09,369 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-07 16:46:09,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:46:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-07 16:46:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:46:09,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:09,371 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:09,372 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:09,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:09,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1506199393, now seen corresponding path program 1 times [2018-11-07 16:46:09,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:09,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:09,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:09,441 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:09,441 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-07 16:46:09,442 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 16:46:09,443 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:46:09,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:46:09,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:46:09,504 INFO L272 AbstractInterpreter]: Visited 14 different actions 53 times. Merged at 5 different actions 22 times. Widened at 2 different actions 3 times. Found 4 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-07 16:46:09,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:09,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:46:09,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:09,540 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:46:09,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:09,553 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:09,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:09,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:09,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:09,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:46:09,716 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:09,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:46:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:46:09,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:46:09,717 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2018-11-07 16:46:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:09,767 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 16:46:09,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:46:09,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-07 16:46:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:09,769 INFO L225 Difference]: With dead ends: 30 [2018-11-07 16:46:09,769 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 16:46:09,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:46:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 16:46:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 16:46:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 16:46:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-07 16:46:09,776 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-11-07 16:46:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:09,776 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-07 16:46:09,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:46:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-07 16:46:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 16:46:09,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:09,777 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:09,777 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:09,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1748455324, now seen corresponding path program 2 times [2018-11-07 16:46:09,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:09,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:09,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:09,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:09,911 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:09,911 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:09,912 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:09,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:09,912 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:46:09,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:09,928 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:09,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:46:09,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:09,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:46:10,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:46:10,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:10,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2018-11-07 16:46:10,263 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:10,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:46:10,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:46:10,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:46:10,265 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2018-11-07 16:46:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:10,345 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-07 16:46:10,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:46:10,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-07 16:46:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:10,346 INFO L225 Difference]: With dead ends: 39 [2018-11-07 16:46:10,347 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 16:46:10,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:46:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 16:46:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-07 16:46:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 16:46:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-07 16:46:10,359 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2018-11-07 16:46:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:10,360 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-07 16:46:10,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:46:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-07 16:46:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 16:46:10,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:10,364 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:10,364 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:10,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1522422854, now seen corresponding path program 3 times [2018-11-07 16:46:10,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:10,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:10,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:10,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:10,368 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:46:10,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:10,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:10,459 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:10,459 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:10,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:10,459 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:46:10,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:10,469 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:10,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:10,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:10,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:46:10,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:46:10,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:10,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:46:10,708 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:10,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:46:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:46:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:46:10,710 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-11-07 16:46:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:10,742 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-07 16:46:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:46:10,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-07 16:46:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:10,743 INFO L225 Difference]: With dead ends: 43 [2018-11-07 16:46:10,743 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 16:46:10,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:46:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 16:46:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 16:46:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 16:46:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-07 16:46:10,750 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2018-11-07 16:46:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:10,751 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-07 16:46:10,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:46:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-07 16:46:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:46:10,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:10,752 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:10,752 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:10,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:10,753 INFO L82 PathProgramCache]: Analyzing trace with hash 634861023, now seen corresponding path program 4 times [2018-11-07 16:46:10,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:10,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:10,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:10,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:10,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:46:10,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:10,849 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:10,849 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:10,849 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:10,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:10,850 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:46:10,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:10,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:10,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:46:10,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:46:11,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:11,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 16:46:11,367 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:11,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:46:11,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:46:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:46:11,368 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-11-07 16:46:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:11,414 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-07 16:46:11,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:46:11,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-07 16:46:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:11,416 INFO L225 Difference]: With dead ends: 46 [2018-11-07 16:46:11,416 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 16:46:11,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:46:11,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 16:46:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-07 16:46:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 16:46:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-07 16:46:11,425 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2018-11-07 16:46:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:11,425 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-07 16:46:11,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:46:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-07 16:46:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:46:11,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:11,427 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:11,427 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:11,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1611776614, now seen corresponding path program 5 times [2018-11-07 16:46:11,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:11,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:11,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:11,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:11,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:46:11,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:11,511 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:11,511 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:11,511 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,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:11,512 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:46:11,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:11,525 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:11,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 16:46:11,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:11,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 16:46:11,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 16:46:11,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:11,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2018-11-07 16:46:11,792 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:11,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:46:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:46:11,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:46:11,796 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 11 states. [2018-11-07 16:46:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:11,944 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-07 16:46:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:46:11,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-07 16:46:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:11,948 INFO L225 Difference]: With dead ends: 53 [2018-11-07 16:46:11,948 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:46:11,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:46:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:46:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-07 16:46:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 16:46:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-07 16:46:11,956 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2018-11-07 16:46:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:11,956 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-07 16:46:11,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:46:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-07 16:46:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 16:46:11,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:11,958 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:11,958 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:11,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2007233660, now seen corresponding path program 6 times [2018-11-07 16:46:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:11,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:11,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:11,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 56 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:46:12,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:12,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:12,088 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:12,088 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:12,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:12,089 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:46:12,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:12,102 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:12,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:12,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:12,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 56 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:46:12,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 56 proven. 63 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:46:12,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:12,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 16:46:12,346 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:12,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:46:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:46:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:46:12,347 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2018-11-07 16:46:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:12,392 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-07 16:46:12,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:46:12,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-07 16:46:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:12,395 INFO L225 Difference]: With dead ends: 58 [2018-11-07 16:46:12,395 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 16:46:12,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:46:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 16:46:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-07 16:46:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 16:46:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-07 16:46:12,401 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 38 [2018-11-07 16:46:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:12,402 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-07 16:46:12,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:46:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-07 16:46:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:46:12,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:12,403 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:12,404 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:12,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash -617976031, now seen corresponding path program 7 times [2018-11-07 16:46:12,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:12,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:12,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 64 proven. 84 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:46:12,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:12,686 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:12,686 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:12,686 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:12,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:12,686 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:46:12,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:12,696 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:12,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 64 proven. 84 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:46:12,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 64 proven. 84 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:46:12,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:12,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 16:46:12,958 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:12,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:46:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:46:12,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:46:12,960 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 10 states. [2018-11-07 16:46:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:13,011 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-07 16:46:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:46:13,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-07 16:46:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:13,018 INFO L225 Difference]: With dead ends: 61 [2018-11-07 16:46:13,018 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 16:46:13,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:46:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 16:46:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-07 16:46:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 16:46:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-07 16:46:13,028 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2018-11-07 16:46:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:13,030 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-07 16:46:13,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:46:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-07 16:46:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 16:46:13,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:13,034 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:13,034 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:13,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1180387748, now seen corresponding path program 8 times [2018-11-07 16:46:13,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:13,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:13,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:13,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 16:46:13,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:13,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:13,256 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:13,257 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:13,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:13,257 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:46:13,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:13,268 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:13,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:46:13,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:13,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:46:13,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:46:13,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:13,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 19 [2018-11-07 16:46:13,488 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:13,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:46:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:46:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:46:13,490 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 15 states. [2018-11-07 16:46:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:13,581 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-11-07 16:46:13,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:46:13,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-07 16:46:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:13,583 INFO L225 Difference]: With dead ends: 68 [2018-11-07 16:46:13,583 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 16:46:13,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:46:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 16:46:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-07 16:46:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 16:46:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-07 16:46:13,590 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 44 [2018-11-07 16:46:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:13,591 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-07 16:46:13,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:46:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-07 16:46:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 16:46:13,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:13,592 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:13,592 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:13,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash 451431418, now seen corresponding path program 9 times [2018-11-07 16:46:13,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:13,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:13,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 110 proven. 135 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:13,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:13,752 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:13,752 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:13,752 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:13,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:13,752 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:46:13,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:13,767 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:13,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:13,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:13,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 110 proven. 135 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:13,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 110 proven. 135 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:14,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:14,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 16:46:14,069 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:14,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:46:14,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:46:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:46:14,070 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 12 states. [2018-11-07 16:46:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:14,128 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-07 16:46:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:46:14,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-07 16:46:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:14,130 INFO L225 Difference]: With dead ends: 73 [2018-11-07 16:46:14,130 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 16:46:14,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:46:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 16:46:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-07 16:46:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:46:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 16:46:14,140 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 50 [2018-11-07 16:46:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:14,140 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 16:46:14,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:46:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 16:46:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 16:46:14,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:14,142 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:14,142 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:14,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1862600929, now seen corresponding path program 10 times [2018-11-07 16:46:14,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:14,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:14,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:14,144 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:14,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:14,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:14,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:14,309 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:14,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:14,309 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:46:14,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:14,318 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:14,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:14,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:14,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:14,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 16:46:14,867 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:14,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:46:14,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:46:14,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:46:14,869 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 13 states. [2018-11-07 16:46:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:15,070 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-11-07 16:46:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:46:15,073 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-11-07 16:46:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:15,075 INFO L225 Difference]: With dead ends: 76 [2018-11-07 16:46:15,076 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 16:46:15,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:46:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 16:46:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-07 16:46:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 16:46:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-07 16:46:15,085 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 53 [2018-11-07 16:46:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:15,086 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-07 16:46:15,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:46:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-07 16:46:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 16:46:15,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:15,089 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:15,089 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:15,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:15,090 INFO L82 PathProgramCache]: Analyzing trace with hash -680182310, now seen corresponding path program 11 times [2018-11-07 16:46:15,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:15,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:15,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:15,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:15,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 132 proven. 198 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:46:15,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:15,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:15,503 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:15,503 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:15,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:15,504 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:46:15,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:15,514 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:15,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 16:46:15,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:15,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 154 proven. 26 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-07 16:46:15,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 154 proven. 26 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-07 16:46:15,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:15,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 24 [2018-11-07 16:46:15,883 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:15,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:46:15,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:46:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:46:15,884 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 19 states. [2018-11-07 16:46:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:15,990 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-07 16:46:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:46:15,991 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-11-07 16:46:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:15,992 INFO L225 Difference]: With dead ends: 83 [2018-11-07 16:46:15,992 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 16:46:15,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:46:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 16:46:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-07 16:46:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 16:46:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-07 16:46:16,007 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 56 [2018-11-07 16:46:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:16,007 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-07 16:46:16,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:46:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-07 16:46:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 16:46:16,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:16,009 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:16,009 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:16,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:16,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1651373252, now seen corresponding path program 12 times [2018-11-07 16:46:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:16,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:16,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 182 proven. 234 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:46:16,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:16,432 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:16,432 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:16,432 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:16,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:16,432 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:46:16,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:16,449 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:16,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:16,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:16,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 182 proven. 234 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:46:16,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 182 proven. 234 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:46:16,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:16,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 16:46:16,889 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:16,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:46:16,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:46:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:46:16,891 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 15 states. [2018-11-07 16:46:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:17,034 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-07 16:46:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:46:17,035 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-07 16:46:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:17,036 INFO L225 Difference]: With dead ends: 88 [2018-11-07 16:46:17,036 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 16:46:17,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:46:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 16:46:17,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-07 16:46:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 16:46:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-11-07 16:46:17,042 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 62 [2018-11-07 16:46:17,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:17,043 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-11-07 16:46:17,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:46:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-07 16:46:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 16:46:17,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:17,044 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:17,044 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:17,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:17,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2031343903, now seen corresponding path program 13 times [2018-11-07 16:46:17,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:17,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:17,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:17,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 273 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:46:17,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:17,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:17,294 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:17,294 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:17,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:17,294 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:46:17,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:17,304 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:17,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 273 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:46:17,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 273 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:46:17,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:17,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 16:46:17,756 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:17,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:46:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:46:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:46:17,758 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 16 states. [2018-11-07 16:46:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:17,845 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-11-07 16:46:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:46:17,845 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2018-11-07 16:46:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:17,846 INFO L225 Difference]: With dead ends: 91 [2018-11-07 16:46:17,846 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 16:46:17,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:46:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 16:46:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-07 16:46:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 16:46:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-11-07 16:46:17,852 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 65 [2018-11-07 16:46:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:17,853 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-11-07 16:46:17,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:46:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-11-07 16:46:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-07 16:46:17,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:17,854 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:17,854 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:17,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash -203215588, now seen corresponding path program 14 times [2018-11-07 16:46:17,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:17,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:17,856 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 210 proven. 315 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:46:18,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:18,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:18,027 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:18,027 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:18,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:18,028 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:46:18,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:18,036 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:18,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:46:18,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:18,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 238 proven. 40 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 16:46:18,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 238 proven. 40 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 16:46:18,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:18,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 29 [2018-11-07 16:46:18,627 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:18,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 16:46:18,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 16:46:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:46:18,629 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 23 states. [2018-11-07 16:46:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:18,851 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-07 16:46:18,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:46:18,852 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-11-07 16:46:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:18,852 INFO L225 Difference]: With dead ends: 98 [2018-11-07 16:46:18,852 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 16:46:18,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:46:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 16:46:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-07 16:46:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 16:46:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-11-07 16:46:18,864 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 68 [2018-11-07 16:46:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:18,864 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-11-07 16:46:18,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 16:46:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-11-07 16:46:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 16:46:18,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:18,865 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 15, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:18,865 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:18,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1919493062, now seen corresponding path program 15 times [2018-11-07 16:46:18,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,870 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 272 proven. 360 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:46:19,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:19,154 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:19,154 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:19,154 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:19,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:19,154 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:46:19,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:19,164 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:19,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:19,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:19,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 272 proven. 360 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:46:19,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 272 proven. 360 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:46:19,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:19,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 16:46:19,630 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:19,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:46:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:46:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:46:19,631 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 18 states. [2018-11-07 16:46:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:19,712 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-11-07 16:46:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:46:19,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-11-07 16:46:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:19,714 INFO L225 Difference]: With dead ends: 103 [2018-11-07 16:46:19,714 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 16:46:19,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:46:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 16:46:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-07 16:46:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 16:46:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-11-07 16:46:19,721 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 74 [2018-11-07 16:46:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:19,721 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-11-07 16:46:19,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:46:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-11-07 16:46:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 16:46:19,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:19,722 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:19,722 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:19,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:19,723 INFO L82 PathProgramCache]: Analyzing trace with hash -871126945, now seen corresponding path program 16 times [2018-11-07 16:46:19,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:19,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:19,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:19,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:19,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 289 proven. 408 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:46:20,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:20,386 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:20,386 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:20,386 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,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:20,386 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:46:20,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:20,398 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:20,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 289 proven. 408 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:46:20,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 289 proven. 408 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:46:21,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:21,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 16:46:21,478 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:21,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:46:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:46:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:46:21,480 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 19 states. [2018-11-07 16:46:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:21,544 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-11-07 16:46:21,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:46:21,545 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-11-07 16:46:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:21,546 INFO L225 Difference]: With dead ends: 106 [2018-11-07 16:46:21,546 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 16:46:21,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:46:21,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 16:46:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-07 16:46:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 16:46:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-11-07 16:46:21,553 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 77 [2018-11-07 16:46:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:21,553 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-11-07 16:46:21,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:46:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-11-07 16:46:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 16:46:21,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:21,554 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:21,554 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:21,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1998311910, now seen corresponding path program 17 times [2018-11-07 16:46:21,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:21,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:21,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:21,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:21,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 459 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:46:21,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:21,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:21,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:21,937 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:21,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:21,938 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:46:21,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:21,946 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:21,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 16:46:21,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:21,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 340 proven. 57 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-11-07 16:46:22,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 340 proven. 57 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-11-07 16:46:23,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:23,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 9] total 34 [2018-11-07 16:46:23,045 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:23,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:46:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:46:23,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:46:23,047 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 27 states. [2018-11-07 16:46:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:23,368 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-11-07 16:46:23,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 16:46:23,368 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-11-07 16:46:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:23,370 INFO L225 Difference]: With dead ends: 113 [2018-11-07 16:46:23,370 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 16:46:23,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:46:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 16:46:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-07 16:46:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 16:46:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-11-07 16:46:23,377 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 80 [2018-11-07 16:46:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:23,378 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-11-07 16:46:23,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:46:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-11-07 16:46:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 16:46:23,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:23,379 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 18, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:23,379 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:23,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1090859516, now seen corresponding path program 18 times [2018-11-07 16:46:23,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:23,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:23,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 380 proven. 513 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:46:23,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:23,656 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:23,656 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:23,656 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:23,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:23,656 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:46:23,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:23,664 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:23,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:23,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:23,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 380 proven. 513 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:46:23,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 380 proven. 513 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:46:24,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:24,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 16:46:24,168 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:24,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:46:24,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:46:24,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:46:24,169 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 21 states. [2018-11-07 16:46:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:24,234 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-11-07 16:46:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:46:24,234 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2018-11-07 16:46:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:24,235 INFO L225 Difference]: With dead ends: 118 [2018-11-07 16:46:24,235 INFO L226 Difference]: Without dead ends: 90 [2018-11-07 16:46:24,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:46:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-07 16:46:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-07 16:46:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 16:46:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2018-11-07 16:46:24,242 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 86 [2018-11-07 16:46:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:24,242 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-11-07 16:46:24,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:46:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-07 16:46:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 16:46:24,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:24,243 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:24,244 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:24,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2019561823, now seen corresponding path program 19 times [2018-11-07 16:46:24,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:24,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:24,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 400 proven. 570 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:46:25,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:25,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:25,151 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:25,151 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:25,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:25,151 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:46:25,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:25,167 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:25,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 400 proven. 570 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:46:25,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 400 proven. 570 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:46:25,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:25,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 16:46:25,827 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:25,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:46:25,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:46:25,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:46:25,829 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 22 states. [2018-11-07 16:46:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:25,937 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2018-11-07 16:46:25,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:46:25,940 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 89 [2018-11-07 16:46:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:25,941 INFO L225 Difference]: With dead ends: 121 [2018-11-07 16:46:25,941 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 16:46:25,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:46:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 16:46:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-07 16:46:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 16:46:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-11-07 16:46:25,948 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 89 [2018-11-07 16:46:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:25,948 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-11-07 16:46:25,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:46:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-07 16:46:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 16:46:25,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:25,949 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:25,950 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:25,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash -662260772, now seen corresponding path program 20 times [2018-11-07 16:46:25,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:25,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:25,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:25,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:25,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 420 proven. 630 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 16:46:26,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:26,193 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:26,193 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:26,193 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:26,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:26,193 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:46:26,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:26,202 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:26,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 16:46:26,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:26,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 460 proven. 77 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-07 16:46:26,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 460 proven. 77 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-07 16:46:26,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:26,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 10] total 39 [2018-11-07 16:46:26,593 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:26,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:46:26,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:46:26,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:46:26,594 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 31 states. [2018-11-07 16:46:26,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:26,862 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2018-11-07 16:46:26,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:46:26,864 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 92 [2018-11-07 16:46:26,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:26,865 INFO L225 Difference]: With dead ends: 128 [2018-11-07 16:46:26,865 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 16:46:26,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:46:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 16:46:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-07 16:46:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 16:46:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-11-07 16:46:26,873 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 92 [2018-11-07 16:46:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:26,873 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-07 16:46:26,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:46:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-11-07 16:46:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 16:46:26,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:26,874 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 21, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:26,874 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:26,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash 976837754, now seen corresponding path program 21 times [2018-11-07 16:46:26,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:26,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:26,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:26,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:26,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 506 proven. 693 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 16:46:27,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:27,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:27,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:27,408 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:27,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:27,408 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:46:27,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:27,417 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:27,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:27,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:27,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 506 proven. 693 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 16:46:27,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 506 proven. 693 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 16:46:28,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:28,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 16:46:28,236 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:28,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:46:28,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:46:28,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:46:28,238 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 24 states. [2018-11-07 16:46:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:28,343 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-07 16:46:28,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:46:28,344 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2018-11-07 16:46:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:28,345 INFO L225 Difference]: With dead ends: 133 [2018-11-07 16:46:28,345 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 16:46:28,346 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:46:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 16:46:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-07 16:46:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 16:46:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-11-07 16:46:28,353 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 98 [2018-11-07 16:46:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:28,353 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-07 16:46:28,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:46:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-11-07 16:46:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 16:46:28,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:28,355 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:28,355 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:28,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:28,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1561151903, now seen corresponding path program 22 times [2018-11-07 16:46:28,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:28,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:28,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:28,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:28,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 529 proven. 759 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 16:46:28,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:28,833 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:28,833 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:28,833 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,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:28,833 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:46:28,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:28,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:28,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 529 proven. 759 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 16:46:28,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 529 proven. 759 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 16:46:29,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:29,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 16:46:29,500 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:29,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:46:29,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:46:29,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:46:29,501 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 25 states. [2018-11-07 16:46:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:29,577 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-11-07 16:46:29,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:46:29,578 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 101 [2018-11-07 16:46:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:29,579 INFO L225 Difference]: With dead ends: 136 [2018-11-07 16:46:29,580 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 16:46:29,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:46:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 16:46:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-07 16:46:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-07 16:46:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2018-11-07 16:46:29,586 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 101 [2018-11-07 16:46:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:29,586 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2018-11-07 16:46:29,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:46:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2018-11-07 16:46:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 16:46:29,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:29,587 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:29,587 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:29,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:29,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1361514074, now seen corresponding path program 23 times [2018-11-07 16:46:29,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:29,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:29,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 552 proven. 828 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 16:46:29,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:29,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:29,975 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:29,975 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:29,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:29,976 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:46:29,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:29,983 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:30,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 16:46:30,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:30,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 598 proven. 100 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 16:46:30,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 598 proven. 100 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 16:46:30,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:30,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11, 11] total 44 [2018-11-07 16:46:30,498 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:30,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 16:46:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 16:46:30,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:46:30,500 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 35 states. [2018-11-07 16:46:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:30,702 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2018-11-07 16:46:30,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 16:46:30,707 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 104 [2018-11-07 16:46:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:30,708 INFO L225 Difference]: With dead ends: 143 [2018-11-07 16:46:30,708 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 16:46:30,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:46:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 16:46:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-11-07 16:46:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 16:46:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-11-07 16:46:30,714 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 104 [2018-11-07 16:46:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:30,714 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-11-07 16:46:30,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 16:46:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-11-07 16:46:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 16:46:30,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:30,716 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 24, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:30,716 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:30,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1687251132, now seen corresponding path program 24 times [2018-11-07 16:46:30,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:30,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:30,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:30,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:30,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 650 proven. 900 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 16:46:31,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:31,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:31,098 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:31,098 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:31,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:31,098 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:46:31,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:31,114 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:31,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:31,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:31,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 650 proven. 900 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 16:46:31,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 650 proven. 900 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 16:46:31,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:31,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 16:46:31,934 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:31,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:46:31,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:46:31,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:31,936 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 27 states. [2018-11-07 16:46:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:32,056 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2018-11-07 16:46:32,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 16:46:32,057 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-07 16:46:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:32,057 INFO L225 Difference]: With dead ends: 148 [2018-11-07 16:46:32,058 INFO L226 Difference]: Without dead ends: 114 [2018-11-07 16:46:32,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-07 16:46:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-07 16:46:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 16:46:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-11-07 16:46:32,064 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 110 [2018-11-07 16:46:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:32,065 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-11-07 16:46:32,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:46:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-11-07 16:46:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 16:46:32,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:32,066 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:32,066 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:32,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1462122911, now seen corresponding path program 25 times [2018-11-07 16:46:32,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:32,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:32,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:32,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:32,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 676 proven. 975 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 16:46:32,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:32,645 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:32,645 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:32,645 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:32,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:32,645 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:46:32,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:32,653 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:32,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 676 proven. 975 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 16:46:32,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 676 proven. 975 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 16:46:33,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:33,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2018-11-07 16:46:33,795 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:33,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:46:33,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:46:33,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:33,797 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 28 states. [2018-11-07 16:46:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:34,119 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2018-11-07 16:46:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:46:34,119 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 113 [2018-11-07 16:46:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:34,120 INFO L225 Difference]: With dead ends: 151 [2018-11-07 16:46:34,121 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 16:46:34,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 16:46:34,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-07 16:46:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 16:46:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2018-11-07 16:46:34,127 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 113 [2018-11-07 16:46:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:34,128 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-11-07 16:46:34,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:46:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-11-07 16:46:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 16:46:34,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:34,129 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:34,129 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:34,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -903656804, now seen corresponding path program 26 times [2018-11-07 16:46:34,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:34,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:34,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:34,131 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 702 proven. 1053 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 16:46:34,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:34,695 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:34,695 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:34,696 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:34,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:34,696 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:46:34,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:34,704 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:34,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 16:46:34,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:34,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 754 proven. 126 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2018-11-07 16:46:34,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 754 proven. 126 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2018-11-07 16:46:35,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:35,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12, 12] total 49 [2018-11-07 16:46:35,378 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:35,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:46:35,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:46:35,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 16:46:35,379 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 39 states. [2018-11-07 16:46:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:35,625 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2018-11-07 16:46:35,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:46:35,625 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 116 [2018-11-07 16:46:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:35,627 INFO L225 Difference]: With dead ends: 158 [2018-11-07 16:46:35,627 INFO L226 Difference]: Without dead ends: 124 [2018-11-07 16:46:35,629 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 16:46:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-07 16:46:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-11-07 16:46:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 16:46:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-11-07 16:46:35,635 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 116 [2018-11-07 16:46:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:35,635 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-11-07 16:46:35,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:46:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-11-07 16:46:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 16:46:35,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:35,636 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 27, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:35,636 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:35,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash 482069690, now seen corresponding path program 27 times [2018-11-07 16:46:35,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:35,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:35,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:35,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:35,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 812 proven. 1134 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 16:46:36,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:36,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:36,222 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:36,223 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:36,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:36,223 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:46:36,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:36,236 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:36,262 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:36,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:36,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 812 proven. 1134 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 16:46:36,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 812 proven. 1134 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 16:46:37,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:37,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2018-11-07 16:46:37,082 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:37,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 16:46:37,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 16:46:37,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:37,084 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 30 states. [2018-11-07 16:46:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:37,243 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2018-11-07 16:46:37,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 16:46:37,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 122 [2018-11-07 16:46:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:37,244 INFO L225 Difference]: With dead ends: 163 [2018-11-07 16:46:37,244 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 16:46:37,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 217 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 16:46:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-07 16:46:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 16:46:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-11-07 16:46:37,251 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 122 [2018-11-07 16:46:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:37,252 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-11-07 16:46:37,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 16:46:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-11-07 16:46:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 16:46:37,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:37,253 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 28, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:37,253 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:37,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:37,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1999381793, now seen corresponding path program 28 times [2018-11-07 16:46:37,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:37,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:37,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:37,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 841 proven. 1218 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 16:46:38,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:38,697 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:38,697 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:38,697 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:38,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:38,697 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:46:38,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:38,705 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:38,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 841 proven. 1218 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 16:46:38,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 841 proven. 1218 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 16:46:39,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:39,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2018-11-07 16:46:39,987 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:39,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:46:39,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:46:39,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:39,988 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 31 states. [2018-11-07 16:46:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:40,180 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2018-11-07 16:46:40,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:46:40,181 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2018-11-07 16:46:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:40,182 INFO L225 Difference]: With dead ends: 166 [2018-11-07 16:46:40,182 INFO L226 Difference]: Without dead ends: 129 [2018-11-07 16:46:40,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 222 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-07 16:46:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-07 16:46:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-07 16:46:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-11-07 16:46:40,190 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 125 [2018-11-07 16:46:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:40,190 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-11-07 16:46:40,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:46:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-11-07 16:46:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 16:46:40,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:40,191 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:40,191 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:40,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:40,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1943413094, now seen corresponding path program 29 times [2018-11-07 16:46:40,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:40,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:40,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 870 proven. 1305 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 16:46:40,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:40,693 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:40,693 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:40,694 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:40,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:40,694 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:46:40,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:40,703 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:40,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 16:46:40,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:40,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 928 proven. 155 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-07 16:46:41,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 928 proven. 155 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-07 16:46:41,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:41,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13, 13] total 54 [2018-11-07 16:46:41,443 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:41,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 16:46:41,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 16:46:41,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:46:41,444 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 43 states. [2018-11-07 16:46:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:41,728 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2018-11-07 16:46:41,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:46:41,728 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 128 [2018-11-07 16:46:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:41,729 INFO L225 Difference]: With dead ends: 173 [2018-11-07 16:46:41,730 INFO L226 Difference]: Without dead ends: 136 [2018-11-07 16:46:41,731 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:46:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-07 16:46:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-11-07 16:46:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 16:46:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2018-11-07 16:46:41,740 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 128 [2018-11-07 16:46:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:41,741 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2018-11-07 16:46:41,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 16:46:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2018-11-07 16:46:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 16:46:41,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:41,742 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 30, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:41,742 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:41,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:41,743 INFO L82 PathProgramCache]: Analyzing trace with hash -339038340, now seen corresponding path program 30 times [2018-11-07 16:46:41,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:41,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:41,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:41,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 992 proven. 1395 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 16:46:42,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:42,205 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:42,205 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:42,205 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:42,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:42,206 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:46:42,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:42,213 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:42,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:42,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:42,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 992 proven. 1395 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 16:46:42,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 992 proven. 1395 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 16:46:43,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:43,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2018-11-07 16:46:43,307 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:43,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 16:46:43,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 16:46:43,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:43,309 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand 33 states. [2018-11-07 16:46:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:43,595 INFO L93 Difference]: Finished difference Result 178 states and 201 transitions. [2018-11-07 16:46:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 16:46:43,596 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 134 [2018-11-07 16:46:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:43,597 INFO L225 Difference]: With dead ends: 178 [2018-11-07 16:46:43,597 INFO L226 Difference]: Without dead ends: 138 [2018-11-07 16:46:43,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 238 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-07 16:46:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-07 16:46:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-07 16:46:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-11-07 16:46:43,604 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 134 [2018-11-07 16:46:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:43,604 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-11-07 16:46:43,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 16:46:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-11-07 16:46:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 16:46:43,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:43,605 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 31, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:43,605 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:43,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1758613983, now seen corresponding path program 31 times [2018-11-07 16:46:43,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:43,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:43,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:43,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:43,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 1024 proven. 1488 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 16:46:45,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:45,416 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:45,416 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:45,416 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:45,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:45,416 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:46:45,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:45,426 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:45,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 1024 proven. 1488 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 16:46:45,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 1024 proven. 1488 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 16:46:46,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:46,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2018-11-07 16:46:46,354 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:46,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 16:46:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 16:46:46,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:46,356 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 34 states. [2018-11-07 16:46:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:46,490 INFO L93 Difference]: Finished difference Result 181 states and 204 transitions. [2018-11-07 16:46:46,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 16:46:46,490 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 137 [2018-11-07 16:46:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:46,492 INFO L225 Difference]: With dead ends: 181 [2018-11-07 16:46:46,492 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 16:46:46,492 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 243 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 16:46:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-11-07 16:46:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 16:46:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-11-07 16:46:46,498 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 137 [2018-11-07 16:46:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:46,499 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-11-07 16:46:46,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 16:46:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-11-07 16:46:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 16:46:46,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:46,500 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 32, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:46,500 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:46,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash 206369116, now seen corresponding path program 32 times [2018-11-07 16:46:46,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:46,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:46,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:46,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:46,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1056 proven. 1584 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 16:46:47,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:47,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:47,575 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:47,575 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:47,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:47,575 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:46:47,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:47,587 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:47,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 16:46:47,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:47,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1120 proven. 187 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2018-11-07 16:46:48,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1120 proven. 187 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2018-11-07 16:46:48,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:48,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 14, 14] total 59 [2018-11-07 16:46:48,666 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:48,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 16:46:48,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 16:46:48,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 16:46:48,668 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 47 states. [2018-11-07 16:46:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:48,892 INFO L93 Difference]: Finished difference Result 188 states and 214 transitions. [2018-11-07 16:46:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 16:46:48,892 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 140 [2018-11-07 16:46:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:48,894 INFO L225 Difference]: With dead ends: 188 [2018-11-07 16:46:48,894 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 16:46:48,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 16:46:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 16:46:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-07 16:46:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 16:46:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2018-11-07 16:46:48,901 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 140 [2018-11-07 16:46:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:48,902 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2018-11-07 16:46:48,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 16:46:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2018-11-07 16:46:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 16:46:48,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:48,903 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 33, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:48,903 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:48,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:48,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1341510406, now seen corresponding path program 33 times [2018-11-07 16:46:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:48,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:48,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1190 proven. 1683 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 16:46:49,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:49,468 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:49,469 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:49,469 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:49,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:49,469 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:46:49,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:49,485 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:49,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:49,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:49,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1190 proven. 1683 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 16:46:49,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1190 proven. 1683 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 16:46:50,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:50,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2018-11-07 16:46:50,599 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:50,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 16:46:50,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 16:46:50,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:50,600 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 36 states. [2018-11-07 16:46:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:50,742 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-11-07 16:46:50,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 16:46:50,742 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 146 [2018-11-07 16:46:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:50,744 INFO L225 Difference]: With dead ends: 193 [2018-11-07 16:46:50,744 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 16:46:50,745 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 259 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 16:46:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-07 16:46:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 16:46:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-11-07 16:46:50,752 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 146 [2018-11-07 16:46:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:50,753 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-11-07 16:46:50,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 16:46:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-11-07 16:46:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 16:46:50,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:50,754 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 34, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:50,754 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:50,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash 324230175, now seen corresponding path program 34 times [2018-11-07 16:46:50,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:50,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:50,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:50,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:50,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 1225 proven. 1785 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 16:46:51,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:51,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:51,294 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:51,294 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:51,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:51,295 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:46:51,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:51,303 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:51,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 1225 proven. 1785 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 16:46:51,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 1225 proven. 1785 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 16:46:52,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:52,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2018-11-07 16:46:52,268 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:52,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 16:46:52,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 16:46:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:52,270 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 37 states. [2018-11-07 16:46:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:52,521 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-07 16:46:52,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 16:46:52,522 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2018-11-07 16:46:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:52,524 INFO L225 Difference]: With dead ends: 196 [2018-11-07 16:46:52,524 INFO L226 Difference]: Without dead ends: 153 [2018-11-07 16:46:52,525 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 264 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-07 16:46:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-11-07 16:46:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 16:46:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-11-07 16:46:52,532 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 149 [2018-11-07 16:46:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:52,532 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-11-07 16:46:52,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 16:46:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-11-07 16:46:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-07 16:46:52,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:52,534 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 35, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:52,534 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:52,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 349740762, now seen corresponding path program 35 times [2018-11-07 16:46:52,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:52,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:52,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1260 proven. 1890 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-07 16:46:53,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:53,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:53,354 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:53,354 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,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:53,354 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:46:53,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:53,363 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:53,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 16:46:53,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:53,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1330 proven. 222 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2018-11-07 16:46:54,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1330 proven. 222 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2018-11-07 16:46:54,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:54,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 15, 15] total 64 [2018-11-07 16:46:54,653 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:54,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 16:46:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 16:46:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:46:54,654 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 51 states. [2018-11-07 16:46:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:54,885 INFO L93 Difference]: Finished difference Result 203 states and 231 transitions. [2018-11-07 16:46:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 16:46:54,886 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 152 [2018-11-07 16:46:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:54,887 INFO L225 Difference]: With dead ends: 203 [2018-11-07 16:46:54,887 INFO L226 Difference]: Without dead ends: 160 [2018-11-07 16:46:54,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:46:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-07 16:46:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-11-07 16:46:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-07 16:46:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2018-11-07 16:46:54,895 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 152 [2018-11-07 16:46:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:54,895 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2018-11-07 16:46:54,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 16:46:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2018-11-07 16:46:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 16:46:54,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:54,897 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 36, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:54,897 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:54,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:54,897 INFO L82 PathProgramCache]: Analyzing trace with hash -616233412, now seen corresponding path program 36 times [2018-11-07 16:46:54,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:54,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:54,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:54,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:54,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1406 proven. 1998 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 16:46:55,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:55,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:55,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:55,582 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:55,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:55,582 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:46:55,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:55,592 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:55,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:55,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:55,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1406 proven. 1998 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 16:46:55,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1406 proven. 1998 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 16:46:56,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:56,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2018-11-07 16:46:56,607 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:56,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:46:56,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:46:56,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:56,609 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 39 states. [2018-11-07 16:46:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:56,725 INFO L93 Difference]: Finished difference Result 208 states and 235 transitions. [2018-11-07 16:46:56,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:46:56,726 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 158 [2018-11-07 16:46:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:56,727 INFO L225 Difference]: With dead ends: 208 [2018-11-07 16:46:56,727 INFO L226 Difference]: Without dead ends: 162 [2018-11-07 16:46:56,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 280 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-07 16:46:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-07 16:46:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 16:46:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2018-11-07 16:46:56,736 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 158 [2018-11-07 16:46:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:56,736 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2018-11-07 16:46:56,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:46:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2018-11-07 16:46:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 16:46:56,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:56,737 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 37, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:56,737 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:56,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:56,738 INFO L82 PathProgramCache]: Analyzing trace with hash 539993569, now seen corresponding path program 37 times [2018-11-07 16:46:56,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:56,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:56,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:56,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 1444 proven. 2109 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 16:46:57,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:57,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:57,569 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:57,569 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:57,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:57,569 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:46:57,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:57,578 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:57,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 1444 proven. 2109 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 16:46:57,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 1444 proven. 2109 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 16:46:59,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:59,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2018-11-07 16:46:59,345 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:59,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 16:46:59,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 16:46:59,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:59,346 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand 40 states. [2018-11-07 16:46:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:59,502 INFO L93 Difference]: Finished difference Result 211 states and 238 transitions. [2018-11-07 16:46:59,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 16:46:59,509 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 161 [2018-11-07 16:46:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:59,510 INFO L225 Difference]: With dead ends: 211 [2018-11-07 16:46:59,510 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 16:46:59,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 285 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:46:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 16:46:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-11-07 16:46:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-07 16:46:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2018-11-07 16:46:59,518 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 161 [2018-11-07 16:46:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:59,518 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2018-11-07 16:46:59,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 16:46:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2018-11-07 16:46:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-07 16:46:59,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:59,519 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 38, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:59,519 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:59,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash 60270620, now seen corresponding path program 38 times [2018-11-07 16:46:59,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:59,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:59,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:59,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1482 proven. 2223 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-07 16:47:00,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:00,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:00,273 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:00,273 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:47:00,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:00,273 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:47:00,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:00,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:00,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 16:47:00,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:00,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1558 proven. 260 refuted. 0 times theorem prover too weak. 2109 trivial. 0 not checked. [2018-11-07 16:47:00,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1558 proven. 260 refuted. 0 times theorem prover too weak. 2109 trivial. 0 not checked. [2018-11-07 16:47:01,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:01,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 16, 16] total 69 [2018-11-07 16:47:01,445 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:01,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 16:47:01,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 16:47:01,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 16:47:01,447 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand 55 states. [2018-11-07 16:47:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:01,882 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2018-11-07 16:47:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 16:47:01,882 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 164 [2018-11-07 16:47:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:01,884 INFO L225 Difference]: With dead ends: 218 [2018-11-07 16:47:01,884 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 16:47:01,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 16:47:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 16:47:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-11-07 16:47:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 16:47:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2018-11-07 16:47:01,894 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 164 [2018-11-07 16:47:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:01,894 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2018-11-07 16:47:01,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 16:47:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2018-11-07 16:47:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 16:47:01,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:01,896 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 39, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:01,896 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:01,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1374651078, now seen corresponding path program 39 times [2018-11-07 16:47:01,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:01,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:01,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1640 proven. 2340 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 16:47:02,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:02,703 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:02,704 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:02,704 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:47:02,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:02,704 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:47:02,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:02,713 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:02,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:02,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:02,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1640 proven. 2340 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 16:47:02,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1640 proven. 2340 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 16:47:03,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:03,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2018-11-07 16:47:03,940 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:03,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 16:47:03,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 16:47:03,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:03,941 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand 42 states. [2018-11-07 16:47:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:04,064 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2018-11-07 16:47:04,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 16:47:04,065 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 170 [2018-11-07 16:47:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:04,066 INFO L225 Difference]: With dead ends: 223 [2018-11-07 16:47:04,066 INFO L226 Difference]: Without dead ends: 174 [2018-11-07 16:47:04,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 301 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-07 16:47:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-11-07 16:47:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 16:47:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-11-07 16:47:04,075 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 170 [2018-11-07 16:47:04,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:04,075 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-11-07 16:47:04,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 16:47:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-11-07 16:47:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 16:47:04,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:04,077 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 40, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:04,077 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:04,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash -8925857, now seen corresponding path program 40 times [2018-11-07 16:47:04,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:04,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:04,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:04,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:04,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 1681 proven. 2460 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 16:47:05,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:05,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:05,044 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:05,044 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:47:05,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:05,044 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:47:05,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:05,053 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:05,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 1681 proven. 2460 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 16:47:05,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 1681 proven. 2460 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 16:47:06,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:06,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2018-11-07 16:47:06,281 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:06,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 16:47:06,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 16:47:06,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:06,282 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 43 states. [2018-11-07 16:47:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:06,411 INFO L93 Difference]: Finished difference Result 226 states and 255 transitions. [2018-11-07 16:47:06,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:47:06,415 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 173 [2018-11-07 16:47:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:06,416 INFO L225 Difference]: With dead ends: 226 [2018-11-07 16:47:06,416 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 16:47:06,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 306 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 16:47:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-07 16:47:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-07 16:47:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2018-11-07 16:47:06,425 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 173 [2018-11-07 16:47:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:06,425 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2018-11-07 16:47:06,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 16:47:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2018-11-07 16:47:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 16:47:06,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:06,426 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 41, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:06,427 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:06,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash 85937946, now seen corresponding path program 41 times [2018-11-07 16:47:06,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:06,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:06,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1722 proven. 2583 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 16:47:07,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:07,157 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:07,157 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:07,157 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:47:07,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:07,157 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:47:07,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:07,165 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:07,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 16:47:07,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:07,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1804 proven. 301 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2018-11-07 16:47:07,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1804 proven. 301 refuted. 0 times theorem prover too weak. 2460 trivial. 0 not checked. [2018-11-07 16:47:08,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:08,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 17, 17] total 74 [2018-11-07 16:47:08,721 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:08,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-07 16:47:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-07 16:47:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 16:47:08,723 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand 59 states. [2018-11-07 16:47:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:09,055 INFO L93 Difference]: Finished difference Result 233 states and 265 transitions. [2018-11-07 16:47:09,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 16:47:09,056 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 176 [2018-11-07 16:47:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:09,057 INFO L225 Difference]: With dead ends: 233 [2018-11-07 16:47:09,057 INFO L226 Difference]: Without dead ends: 184 [2018-11-07 16:47:09,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 16:47:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-07 16:47:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-11-07 16:47:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-07 16:47:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2018-11-07 16:47:09,064 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 176 [2018-11-07 16:47:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:09,065 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2018-11-07 16:47:09,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-07 16:47:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2018-11-07 16:47:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 16:47:09,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:09,066 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 42, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:09,066 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:09,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1735103236, now seen corresponding path program 42 times [2018-11-07 16:47:09,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:09,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:09,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:09,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:09,068 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1892 proven. 2709 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 16:47:09,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:09,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:09,866 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:09,866 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:47:09,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:09,867 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:47:09,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:09,875 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:09,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:09,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:09,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1892 proven. 2709 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 16:47:09,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1892 proven. 2709 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 16:47:10,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:10,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2018-11-07 16:47:10,898 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:10,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 16:47:10,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 16:47:10,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:10,899 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand 45 states. [2018-11-07 16:47:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:11,107 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2018-11-07 16:47:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 16:47:11,108 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 182 [2018-11-07 16:47:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:11,109 INFO L225 Difference]: With dead ends: 238 [2018-11-07 16:47:11,109 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 16:47:11,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 322 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 16:47:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-11-07 16:47:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-07 16:47:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2018-11-07 16:47:11,118 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 182 [2018-11-07 16:47:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:11,118 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2018-11-07 16:47:11,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 16:47:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2018-11-07 16:47:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 16:47:11,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:11,120 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 43, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:11,120 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:11,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1920183713, now seen corresponding path program 43 times [2018-11-07 16:47:11,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:11,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:11,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:11,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:11,121 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 1936 proven. 2838 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 16:47:12,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:12,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:12,015 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:12,015 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:47:12,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:12,015 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:47:12,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:12,025 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:12,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 1936 proven. 2838 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 16:47:12,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 1936 proven. 2838 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 16:47:13,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:13,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2018-11-07 16:47:13,068 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:13,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 16:47:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 16:47:13,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:13,070 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand 46 states. [2018-11-07 16:47:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:13,412 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2018-11-07 16:47:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 16:47:13,412 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 185 [2018-11-07 16:47:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:13,413 INFO L225 Difference]: With dead ends: 241 [2018-11-07 16:47:13,413 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 16:47:13,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 327 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 16:47:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-11-07 16:47:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 16:47:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 204 transitions. [2018-11-07 16:47:13,422 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 204 transitions. Word has length 185 [2018-11-07 16:47:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:13,422 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 204 transitions. [2018-11-07 16:47:13,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 16:47:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 204 transitions. [2018-11-07 16:47:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 16:47:13,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:13,423 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 44, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:13,424 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:13,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1972858588, now seen corresponding path program 44 times [2018-11-07 16:47:13,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:13,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:13,425 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 1980 proven. 2970 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-07 16:47:14,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:14,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:14,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:14,308 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:47:14,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:14,308 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:47:14,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:14,317 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:14,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 16:47:14,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:14,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 2068 proven. 345 refuted. 0 times theorem prover too weak. 2838 trivial. 0 not checked. [2018-11-07 16:47:15,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 2068 proven. 345 refuted. 0 times theorem prover too weak. 2838 trivial. 0 not checked. [2018-11-07 16:47:15,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:15,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 18, 18] total 79 [2018-11-07 16:47:15,821 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:15,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 16:47:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 16:47:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 16:47:15,823 INFO L87 Difference]: Start difference. First operand 189 states and 204 transitions. Second operand 63 states. [2018-11-07 16:47:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:16,183 INFO L93 Difference]: Finished difference Result 248 states and 282 transitions. [2018-11-07 16:47:16,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 16:47:16,183 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 188 [2018-11-07 16:47:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:16,184 INFO L225 Difference]: With dead ends: 248 [2018-11-07 16:47:16,184 INFO L226 Difference]: Without dead ends: 196 [2018-11-07 16:47:16,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 16:47:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-07 16:47:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-11-07 16:47:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 16:47:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2018-11-07 16:47:16,191 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 188 [2018-11-07 16:47:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:16,191 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2018-11-07 16:47:16,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 16:47:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2018-11-07 16:47:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 16:47:16,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:16,192 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 45, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:16,192 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:16,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash -809845382, now seen corresponding path program 45 times [2018-11-07 16:47:16,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:16,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:16,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:16,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:16,194 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2162 proven. 3105 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 16:47:19,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:19,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:19,241 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:19,241 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:47:19,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:19,242 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:47:19,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:19,251 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:19,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:19,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:19,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2162 proven. 3105 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 16:47:19,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2162 proven. 3105 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 16:47:20,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:20,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2018-11-07 16:47:20,559 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:20,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 16:47:20,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 16:47:20,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:20,560 INFO L87 Difference]: Start difference. First operand 195 states and 211 transitions. Second operand 48 states. [2018-11-07 16:47:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:20,705 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2018-11-07 16:47:20,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 16:47:20,706 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 194 [2018-11-07 16:47:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:20,707 INFO L225 Difference]: With dead ends: 253 [2018-11-07 16:47:20,707 INFO L226 Difference]: Without dead ends: 198 [2018-11-07 16:47:20,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 343 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-07 16:47:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-11-07 16:47:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-07 16:47:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-11-07 16:47:20,717 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 194 [2018-11-07 16:47:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:20,717 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-11-07 16:47:20,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 16:47:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-11-07 16:47:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 16:47:20,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:20,719 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 46, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:20,719 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:20,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:20,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1328361119, now seen corresponding path program 46 times [2018-11-07 16:47:20,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:20,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:20,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:20,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:20,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 2209 proven. 3243 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 16:47:22,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:22,154 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:22,154 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:22,154 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:47:22,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:22,155 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:47:22,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:22,162 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:22,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 2209 proven. 3243 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 16:47:22,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 2209 proven. 3243 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 16:47:23,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:23,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2018-11-07 16:47:23,277 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:23,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 16:47:23,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 16:47:23,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:23,278 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 49 states. [2018-11-07 16:47:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:23,562 INFO L93 Difference]: Finished difference Result 256 states and 289 transitions. [2018-11-07 16:47:23,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 16:47:23,562 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 197 [2018-11-07 16:47:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:23,563 INFO L225 Difference]: With dead ends: 256 [2018-11-07 16:47:23,563 INFO L226 Difference]: Without dead ends: 201 [2018-11-07 16:47:23,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 348 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-07 16:47:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-11-07 16:47:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-07 16:47:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 217 transitions. [2018-11-07 16:47:23,569 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 217 transitions. Word has length 197 [2018-11-07 16:47:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:23,569 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 217 transitions. [2018-11-07 16:47:23,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 16:47:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 217 transitions. [2018-11-07 16:47:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 16:47:23,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:23,570 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 47, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:23,571 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:23,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:23,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1978265434, now seen corresponding path program 47 times [2018-11-07 16:47:23,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:23,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:23,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:23,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:23,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2256 proven. 3384 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-07 16:47:25,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:25,328 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:25,329 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:25,329 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:47:25,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:25,329 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:47:25,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:25,338 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:25,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 16:47:25,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:25,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2350 proven. 392 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2018-11-07 16:47:26,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2350 proven. 392 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2018-11-07 16:47:27,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:27,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 19, 19] total 84 [2018-11-07 16:47:27,054 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:27,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 16:47:27,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 16:47:27,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 16:47:27,056 INFO L87 Difference]: Start difference. First operand 201 states and 217 transitions. Second operand 67 states. [2018-11-07 16:47:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:27,470 INFO L93 Difference]: Finished difference Result 263 states and 299 transitions. [2018-11-07 16:47:27,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 16:47:27,470 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 200 [2018-11-07 16:47:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:27,471 INFO L225 Difference]: With dead ends: 263 [2018-11-07 16:47:27,471 INFO L226 Difference]: Without dead ends: 208 [2018-11-07 16:47:27,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 16:47:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-07 16:47:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-11-07 16:47:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-07 16:47:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2018-11-07 16:47:27,482 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 200 [2018-11-07 16:47:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:27,482 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2018-11-07 16:47:27,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 16:47:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2018-11-07 16:47:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 16:47:27,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:27,499 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 48, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:27,500 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:27,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:27,500 INFO L82 PathProgramCache]: Analyzing trace with hash 709682108, now seen corresponding path program 48 times [2018-11-07 16:47:27,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:27,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:27,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:27,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:27,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2450 proven. 3528 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 16:47:28,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:28,726 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:28,726 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:28,726 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:47:28,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:28,726 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:47:28,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:28,734 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:28,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:28,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:28,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2450 proven. 3528 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 16:47:28,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2450 proven. 3528 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 16:47:29,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:29,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2018-11-07 16:47:29,860 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:29,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 16:47:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 16:47:29,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:29,861 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand 51 states. [2018-11-07 16:47:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:31,208 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2018-11-07 16:47:31,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 16:47:31,209 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 206 [2018-11-07 16:47:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:31,211 INFO L225 Difference]: With dead ends: 268 [2018-11-07 16:47:31,211 INFO L226 Difference]: Without dead ends: 210 [2018-11-07 16:47:31,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 364 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-07 16:47:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-07 16:47:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 16:47:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-11-07 16:47:31,219 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 206 [2018-11-07 16:47:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:31,220 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-11-07 16:47:31,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 16:47:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-11-07 16:47:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 16:47:31,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:31,221 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 49, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:31,221 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:31,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1569572193, now seen corresponding path program 49 times [2018-11-07 16:47:31,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:31,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:31,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:31,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:31,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 2500 proven. 3675 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 16:47:32,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:32,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:32,447 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:32,447 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:47:32,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:32,447 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:47:32,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:32,456 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:32,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 2500 proven. 3675 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 16:47:32,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 2500 proven. 3675 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-07 16:47:33,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:33,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-11-07 16:47:33,598 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:33,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 16:47:33,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 16:47:33,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:33,599 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 52 states. [2018-11-07 16:47:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:33,879 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2018-11-07 16:47:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 16:47:33,880 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 209 [2018-11-07 16:47:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:33,881 INFO L225 Difference]: With dead ends: 271 [2018-11-07 16:47:33,881 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 16:47:33,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 369 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 16:47:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-11-07 16:47:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-07 16:47:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 230 transitions. [2018-11-07 16:47:33,889 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 230 transitions. Word has length 209 [2018-11-07 16:47:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:33,889 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 230 transitions. [2018-11-07 16:47:33,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 16:47:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 230 transitions. [2018-11-07 16:47:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 16:47:33,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:33,890 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 50, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:33,891 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:33,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:33,891 INFO L82 PathProgramCache]: Analyzing trace with hash -924826212, now seen corresponding path program 50 times [2018-11-07 16:47:33,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:33,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:33,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:33,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:33,892 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 2832 proven. 551 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:47:34,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:34,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:34,429 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:34,429 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:47:34,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:34,429 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:47:34,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:34,441 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:34,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 16:47:34,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:34,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 2650 proven. 442 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 16:47:34,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 2650 proven. 442 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 16:47:34,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:34,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 40 [2018-11-07 16:47:34,967 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:34,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:47:34,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:47:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:47:34,968 INFO L87 Difference]: Start difference. First operand 213 states and 230 transitions. Second operand 22 states. [2018-11-07 16:47:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:35,067 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2018-11-07 16:47:35,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:47:35,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 212 [2018-11-07 16:47:35,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:35,070 INFO L225 Difference]: With dead ends: 228 [2018-11-07 16:47:35,070 INFO L226 Difference]: Without dead ends: 223 [2018-11-07 16:47:35,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:47:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-07 16:47:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2018-11-07 16:47:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-07 16:47:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 242 transitions. [2018-11-07 16:47:35,077 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 242 transitions. Word has length 212 [2018-11-07 16:47:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:35,077 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 242 transitions. [2018-11-07 16:47:35,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:47:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 242 transitions. [2018-11-07 16:47:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 16:47:35,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:35,079 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 50, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:35,079 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:35,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash 890030239, now seen corresponding path program 51 times [2018-11-07 16:47:35,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:35,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:35,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:35,081 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 3264 proven. 737 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:47:35,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:35,502 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:35,503 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:35,503 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:47:35,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:35,503 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:47:35,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:35,512 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:35,562 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:35,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:35,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:37,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:40,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:40,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 73, 73] total 102 [2018-11-07 16:47:40,099 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:40,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 16:47:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 16:47:40,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:47:40,101 INFO L87 Difference]: Start difference. First operand 222 states and 242 transitions. Second operand 75 states. [2018-11-07 16:47:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:40,521 INFO L93 Difference]: Finished difference Result 237 states and 263 transitions. [2018-11-07 16:47:40,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-07 16:47:40,522 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 221 [2018-11-07 16:47:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:40,523 INFO L225 Difference]: With dead ends: 237 [2018-11-07 16:47:40,523 INFO L226 Difference]: Without dead ends: 232 [2018-11-07 16:47:40,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 322 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10292 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:47:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-07 16:47:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-11-07 16:47:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-07 16:47:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2018-11-07 16:47:40,531 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 221 [2018-11-07 16:47:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:40,532 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2018-11-07 16:47:40,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 16:47:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2018-11-07 16:47:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 16:47:40,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:40,533 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 50, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:40,534 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:40,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:40,534 INFO L82 PathProgramCache]: Analyzing trace with hash 740292860, now seen corresponding path program 52 times [2018-11-07 16:47:40,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:40,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:40,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:40,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:40,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 3696 proven. 950 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:47:41,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:41,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:41,714 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:41,714 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:47:41,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:41,714 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:47:41,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:41,723 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:41,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:43,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:45,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:45,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 76, 76] total 102 [2018-11-07 16:47:45,263 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:45,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-07 16:47:45,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-07 16:47:45,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:47:45,265 INFO L87 Difference]: Start difference. First operand 231 states and 254 transitions. Second operand 78 states. [2018-11-07 16:47:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:45,802 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2018-11-07 16:47:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-11-07 16:47:45,802 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 230 [2018-11-07 16:47:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:45,804 INFO L225 Difference]: With dead ends: 246 [2018-11-07 16:47:45,804 INFO L226 Difference]: Without dead ends: 241 [2018-11-07 16:47:45,805 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 337 SyntacticMatches, 50 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11027 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:47:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-07 16:47:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2018-11-07 16:47:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-07 16:47:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 266 transitions. [2018-11-07 16:47:45,812 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 266 transitions. Word has length 230 [2018-11-07 16:47:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:45,813 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 266 transitions. [2018-11-07 16:47:45,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-07 16:47:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 266 transitions. [2018-11-07 16:47:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-07 16:47:45,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:45,815 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 50, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:45,815 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:45,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:45,815 INFO L82 PathProgramCache]: Analyzing trace with hash -28253889, now seen corresponding path program 53 times [2018-11-07 16:47:45,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:45,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:45,816 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 4128 proven. 1190 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:47:46,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:46,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:46,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:46,408 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:47:46,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:46,408 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:47:46,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:46,429 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:46,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-07 16:47:46,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:46,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 4000 proven. 1027 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 16:47:46,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 4000 proven. 1027 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 16:47:47,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:47,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 29] total 52 [2018-11-07 16:47:47,308 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:47,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:47:47,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:47:47,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:47,310 INFO L87 Difference]: Start difference. First operand 240 states and 266 transitions. Second operand 31 states. [2018-11-07 16:47:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:47,463 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2018-11-07 16:47:47,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:47:47,464 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 239 [2018-11-07 16:47:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:47,466 INFO L225 Difference]: With dead ends: 255 [2018-11-07 16:47:47,466 INFO L226 Difference]: Without dead ends: 250 [2018-11-07 16:47:47,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 452 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-07 16:47:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-11-07 16:47:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-07 16:47:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 278 transitions. [2018-11-07 16:47:47,475 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 278 transitions. Word has length 239 [2018-11-07 16:47:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:47,476 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 278 transitions. [2018-11-07 16:47:47,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:47:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 278 transitions. [2018-11-07 16:47:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 16:47:47,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:47,478 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 50, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:47,478 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:47,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash 534615132, now seen corresponding path program 54 times [2018-11-07 16:47:47,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:47,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:47,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:47,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:47,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 4560 proven. 1457 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:47:48,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:48,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:48,357 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:48,357 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:47:48,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:48,357 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:47:48,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:48,365 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:48,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:48,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:48,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:49,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:51,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:51,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 82, 82] total 102 [2018-11-07 16:47:51,430 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:51,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-07 16:47:51,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-07 16:47:51,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:47:51,431 INFO L87 Difference]: Start difference. First operand 249 states and 278 transitions. Second operand 84 states. [2018-11-07 16:47:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:52,165 INFO L93 Difference]: Finished difference Result 264 states and 299 transitions. [2018-11-07 16:47:52,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-07 16:47:52,165 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 248 [2018-11-07 16:47:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:52,167 INFO L225 Difference]: With dead ends: 264 [2018-11-07 16:47:52,167 INFO L226 Difference]: Without dead ends: 259 [2018-11-07 16:47:52,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 367 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12497 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:47:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-07 16:47:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2018-11-07 16:47:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-07 16:47:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 290 transitions. [2018-11-07 16:47:52,175 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 290 transitions. Word has length 248 [2018-11-07 16:47:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:52,176 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 290 transitions. [2018-11-07 16:47:52,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-07 16:47:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 290 transitions. [2018-11-07 16:47:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-07 16:47:52,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:52,177 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 50, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:52,178 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:52,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash 37491167, now seen corresponding path program 55 times [2018-11-07 16:47:52,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:52,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:52,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:52,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:52,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 4992 proven. 1751 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:47:52,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:52,729 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:52,729 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:52,729 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:47:52,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:52,729 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:47:52,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:52,737 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:52,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:53,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:56,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:56,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 85, 85] total 102 [2018-11-07 16:47:56,027 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:56,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-11-07 16:47:56,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-11-07 16:47:56,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:47:56,029 INFO L87 Difference]: Start difference. First operand 258 states and 290 transitions. Second operand 87 states. [2018-11-07 16:47:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:56,885 INFO L93 Difference]: Finished difference Result 273 states and 311 transitions. [2018-11-07 16:47:56,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-11-07 16:47:56,886 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 257 [2018-11-07 16:47:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:56,887 INFO L225 Difference]: With dead ends: 273 [2018-11-07 16:47:56,888 INFO L226 Difference]: Without dead ends: 268 [2018-11-07 16:47:56,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 382 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13232 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:47:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-07 16:47:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2018-11-07 16:47:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-07 16:47:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 302 transitions. [2018-11-07 16:47:56,896 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 302 transitions. Word has length 257 [2018-11-07 16:47:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:56,897 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 302 transitions. [2018-11-07 16:47:56,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-11-07 16:47:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 302 transitions. [2018-11-07 16:47:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-07 16:47:56,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:56,899 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 50, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:56,899 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:56,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:56,899 INFO L82 PathProgramCache]: Analyzing trace with hash -949020740, now seen corresponding path program 56 times [2018-11-07 16:47:56,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:56,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:56,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:56,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:56,900 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 5424 proven. 2072 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:47:57,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:57,659 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:57,660 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:57,660 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:47:57,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:57,660 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:47:57,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:57,670 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:57,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-11-07 16:47:57,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:57,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 5350 proven. 1855 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 16:47:57,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 5350 proven. 1855 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 16:47:58,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:58,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 38] total 52 [2018-11-07 16:47:58,686 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:58,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 16:47:58,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 16:47:58,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:58,687 INFO L87 Difference]: Start difference. First operand 267 states and 302 transitions. Second operand 40 states. [2018-11-07 16:47:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:58,916 INFO L93 Difference]: Finished difference Result 282 states and 323 transitions. [2018-11-07 16:47:58,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 16:47:58,916 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 266 [2018-11-07 16:47:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:58,917 INFO L225 Difference]: With dead ends: 282 [2018-11-07 16:47:58,918 INFO L226 Difference]: Without dead ends: 277 [2018-11-07 16:47:58,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 497 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-07 16:47:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2018-11-07 16:47:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-07 16:47:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 314 transitions. [2018-11-07 16:47:58,926 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 314 transitions. Word has length 266 [2018-11-07 16:47:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:58,927 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 314 transitions. [2018-11-07 16:47:58,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 16:47:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 314 transitions. [2018-11-07 16:47:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-07 16:47:58,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:58,929 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 50, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:58,929 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:58,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:58,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2117622399, now seen corresponding path program 57 times [2018-11-07 16:47:58,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:58,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:58,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:58,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:58,930 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 5856 proven. 2420 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:48:00,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:00,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:00,032 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:00,032 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:48:00,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:00,032 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:00,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:00,040 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:00,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:00,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:00,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:01,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:03,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:03,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 91, 91] total 102 [2018-11-07 16:48:03,179 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:03,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-07 16:48:03,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-07 16:48:03,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:48:03,181 INFO L87 Difference]: Start difference. First operand 276 states and 314 transitions. Second operand 93 states. [2018-11-07 16:48:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:04,199 INFO L93 Difference]: Finished difference Result 291 states and 335 transitions. [2018-11-07 16:48:04,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-11-07 16:48:04,199 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 275 [2018-11-07 16:48:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:04,201 INFO L225 Difference]: With dead ends: 291 [2018-11-07 16:48:04,201 INFO L226 Difference]: Without dead ends: 286 [2018-11-07 16:48:04,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 412 SyntacticMatches, 80 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14702 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:48:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-07 16:48:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-11-07 16:48:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-07 16:48:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 326 transitions. [2018-11-07 16:48:04,212 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 326 transitions. Word has length 275 [2018-11-07 16:48:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:04,212 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 326 transitions. [2018-11-07 16:48:04,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-07 16:48:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 326 transitions. [2018-11-07 16:48:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-07 16:48:04,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:04,214 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:04,215 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:04,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:04,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1554678556, now seen corresponding path program 58 times [2018-11-07 16:48:04,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:04,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:04,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:04,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:04,216 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 6288 proven. 2795 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:48:05,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:05,255 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:05,255 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:05,255 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:48:05,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:05,255 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:05,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:05,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:05,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:06,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:08,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:08,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 94, 94] total 102 [2018-11-07 16:48:08,183 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:08,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-07 16:48:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-07 16:48:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:48:08,185 INFO L87 Difference]: Start difference. First operand 285 states and 326 transitions. Second operand 96 states. [2018-11-07 16:48:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:09,304 INFO L93 Difference]: Finished difference Result 300 states and 347 transitions. [2018-11-07 16:48:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-07 16:48:09,305 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 284 [2018-11-07 16:48:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:09,306 INFO L225 Difference]: With dead ends: 300 [2018-11-07 16:48:09,306 INFO L226 Difference]: Without dead ends: 295 [2018-11-07 16:48:09,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 427 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15437 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:48:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-07 16:48:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2018-11-07 16:48:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-07 16:48:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 338 transitions. [2018-11-07 16:48:09,313 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 338 transitions. Word has length 284 [2018-11-07 16:48:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:09,314 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 338 transitions. [2018-11-07 16:48:09,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-07 16:48:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 338 transitions. [2018-11-07 16:48:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-07 16:48:09,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:09,324 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 50, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:09,324 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:09,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -382747873, now seen corresponding path program 59 times [2018-11-07 16:48:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:09,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:09,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:09,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 6720 proven. 3197 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:48:10,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:10,475 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:10,475 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:10,475 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:48:10,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:10,475 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:10,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:10,487 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:10,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2018-11-07 16:48:10,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:10,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 6700 proven. 2926 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 16:48:10,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 6700 proven. 2926 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-11-07 16:48:11,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:11,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47, 47] total 52 [2018-11-07 16:48:11,631 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:11,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 16:48:11,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 16:48:11,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:48:11,632 INFO L87 Difference]: Start difference. First operand 294 states and 338 transitions. Second operand 49 states. [2018-11-07 16:48:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:12,011 INFO L93 Difference]: Finished difference Result 309 states and 359 transitions. [2018-11-07 16:48:12,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 16:48:12,011 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 293 [2018-11-07 16:48:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:12,013 INFO L225 Difference]: With dead ends: 309 [2018-11-07 16:48:12,013 INFO L226 Difference]: Without dead ends: 304 [2018-11-07 16:48:12,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 542 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:48:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-07 16:48:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2018-11-07 16:48:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-07 16:48:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 350 transitions. [2018-11-07 16:48:12,020 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 350 transitions. Word has length 293 [2018-11-07 16:48:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:12,020 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 350 transitions. [2018-11-07 16:48:12,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 16:48:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 350 transitions. [2018-11-07 16:48:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-07 16:48:12,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:12,022 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 50, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:12,022 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:12,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1880762756, now seen corresponding path program 60 times [2018-11-07 16:48:12,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:12,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:12,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:12,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:12,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 7152 proven. 3626 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-11-07 16:48:13,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:13,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:13,114 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:13,115 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:48:13,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:13,115 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:13,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:13,125 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:13,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:13,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:13,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:14,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:16,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:16,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 100, 100] total 102 [2018-11-07 16:48:16,603 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:16,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-11-07 16:48:16,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-11-07 16:48:16,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:48:16,605 INFO L87 Difference]: Start difference. First operand 303 states and 350 transitions. Second operand 102 states. [2018-11-07 16:48:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:17,849 INFO L93 Difference]: Finished difference Result 317 states and 369 transitions. [2018-11-07 16:48:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-07 16:48:17,849 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 302 [2018-11-07 16:48:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:17,851 INFO L225 Difference]: With dead ends: 317 [2018-11-07 16:48:17,851 INFO L226 Difference]: Without dead ends: 312 [2018-11-07 16:48:17,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 457 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16907 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:48:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-07 16:48:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-11-07 16:48:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-07 16:48:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 362 transitions. [2018-11-07 16:48:17,861 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 362 transitions. Word has length 302 [2018-11-07 16:48:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:17,862 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 362 transitions. [2018-11-07 16:48:17,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-11-07 16:48:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 362 transitions. [2018-11-07 16:48:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-07 16:48:17,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:17,864 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:17,864 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:17,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1819528257, now seen corresponding path program 61 times [2018-11-07 16:48:17,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:17,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:17,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:17,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:17,865 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 16:48:20,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:20,815 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:20,815 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:20,815 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:48:20,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:20,816 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:20,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:20,824 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:20,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 16:48:21,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 16:48:21,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:21,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2018-11-07 16:48:21,797 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:21,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 16:48:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 16:48:21,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 16:48:21,798 INFO L87 Difference]: Start difference. First operand 312 states and 362 transitions. Second operand 55 states. [2018-11-07 16:48:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:23,807 INFO L93 Difference]: Finished difference Result 4294 states and 5669 transitions. [2018-11-07 16:48:23,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 16:48:23,808 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 311 [2018-11-07 16:48:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:23,823 INFO L225 Difference]: With dead ends: 4294 [2018-11-07 16:48:23,823 INFO L226 Difference]: Without dead ends: 4289 [2018-11-07 16:48:23,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 616 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 16:48:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2018-11-07 16:48:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 315. [2018-11-07 16:48:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-11-07 16:48:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 366 transitions. [2018-11-07 16:48:23,906 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 366 transitions. Word has length 311 [2018-11-07 16:48:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:23,907 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 366 transitions. [2018-11-07 16:48:23,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 16:48:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 366 transitions. [2018-11-07 16:48:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-07 16:48:23,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:23,909 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:23,909 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:23,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:23,910 INFO L82 PathProgramCache]: Analyzing trace with hash 908591292, now seen corresponding path program 62 times [2018-11-07 16:48:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:23,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:23,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:23,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:23,911 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15352 backedges. 11527 proven. 0 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-11-07 16:48:25,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:48:25,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-11-07 16:48:25,405 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:25,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 16:48:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 16:48:25,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:48:25,406 INFO L87 Difference]: Start difference. First operand 315 states and 366 transitions. Second operand 52 states. [2018-11-07 16:48:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:25,721 INFO L93 Difference]: Finished difference Result 464 states and 564 transitions. [2018-11-07 16:48:25,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 16:48:25,722 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 314 [2018-11-07 16:48:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:25,723 INFO L225 Difference]: With dead ends: 464 [2018-11-07 16:48:25,723 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:48:25,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:48:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:48:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:48:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:48:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:48:25,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 314 [2018-11-07 16:48:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:25,727 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:48:25,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 16:48:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:48:25,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:48:25,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:48:26,763 WARN L179 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 1837 DAG size of output: 407 [2018-11-07 16:48:30,677 WARN L179 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-11-07 16:48:30,709 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 16:48:30,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:48:30,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:48:30,709 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 16:48:30,710 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:48:30,710 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:48:30,710 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-07 16:48:30,710 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-07 16:48:30,710 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-07 16:48:30,710 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2018-11-07 16:48:30,710 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2018-11-07 16:48:30,710 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 20) no Hoare annotation was computed. [2018-11-07 16:48:30,712 INFO L421 ceAbstractionStarter]: At program point L14-2(lines 13 20) the Hoare annotation is: (or (and (and (<= main_~x~0 99) (<= 99 main_~y~0) (<= main_~y~0 99)) (<= 99 main_~x~0)) (and (and (<= main_~y~0 92) (<= 92 main_~y~0) (<= main_~x~0 92)) (<= 92 main_~x~0)) (and (<= 65 main_~x~0) (and (<= main_~y~0 65) (<= 65 main_~y~0) (<= main_~x~0 65))) (and (and (<= main_~y~0 100) (< 99 main_~y~0)) (<= 100 main_~x~0)) (and (<= 64 main_~x~0) (and (<= main_~x~0 64) (<= 64 main_~y~0) (<= main_~y~0 64))) (and (<= 76 main_~x~0) (and (<= main_~y~0 76) (<= main_~x~0 76) (<= 76 main_~y~0))) (and (<= 87 main_~x~0) (and (<= main_~x~0 87) (<= main_~y~0 87) (<= 87 main_~y~0))) (and (and (<= main_~y~0 78) (<= 78 main_~y~0) (<= main_~x~0 78)) (<= 78 main_~x~0)) (and (<= 72 main_~x~0) (and (<= main_~y~0 72) (<= main_~x~0 72) (<= 72 main_~y~0))) (and (and (<= main_~y~0 69) (<= 69 main_~y~0) (<= main_~x~0 69)) (<= 69 main_~x~0)) (and (<= 60 main_~x~0) (and (<= main_~x~0 60) (<= main_~y~0 60) (<= 60 main_~y~0))) (and (<= 67 main_~x~0) (and (<= main_~y~0 67) (<= main_~x~0 67) (<= 67 main_~y~0))) (and (and (<= main_~y~0 55) (<= 55 main_~y~0) (<= main_~x~0 55)) (<= 55 main_~x~0)) (and (and (<= 73 main_~y~0) (<= main_~x~0 73) (<= main_~y~0 73)) (<= 73 main_~x~0)) (and (<= 66 main_~x~0) (and (<= main_~y~0 66) (<= 66 main_~y~0) (<= main_~x~0 66))) (and (and (<= main_~x~0 70) (<= main_~y~0 70) (<= 70 main_~y~0)) (<= 70 main_~x~0)) (and (and (<= main_~x~0 95) (<= main_~y~0 95) (<= 95 main_~y~0)) (<= 95 main_~x~0)) (and (and (<= 90 main_~y~0) (<= main_~y~0 90) (<= main_~x~0 90)) (<= 90 main_~x~0)) (and (and (<= main_~y~0 59) (<= main_~x~0 59) (<= 59 main_~y~0)) (<= 59 main_~x~0)) (and (<= 85 main_~x~0) (and (<= 85 main_~y~0) (<= main_~x~0 85) (<= main_~y~0 85))) (and (<= 63 main_~x~0) (and (<= main_~y~0 63) (<= main_~x~0 63) (<= 63 main_~y~0))) (and (and (<= main_~y~0 77) (<= main_~x~0 77) (<= 77 main_~y~0)) (<= 77 main_~x~0)) (and (<= 53 main_~x~0) (and (<= main_~y~0 53) (<= main_~x~0 53) (<= 53 main_~y~0))) (and (and (<= main_~x~0 79) (<= main_~y~0 79) (<= 79 main_~y~0)) (<= 79 main_~x~0)) (and (<= 68 main_~x~0) (and (<= 68 main_~y~0) (<= main_~y~0 68) (<= main_~x~0 68))) (and (<= 51 main_~x~0) (and (<= 51 main_~y~0) (<= main_~x~0 51) (<= main_~y~0 51))) (and (<= 54 main_~x~0) (and (<= main_~x~0 54) (<= 54 main_~y~0) (<= main_~y~0 54))) (and (and (<= 56 main_~y~0) (<= main_~x~0 56) (<= main_~y~0 56)) (<= 56 main_~x~0)) (and (<= 61 main_~x~0) (and (<= main_~y~0 61) (<= 61 main_~y~0) (<= main_~x~0 61))) (and (<= 88 main_~x~0) (and (<= main_~x~0 88) (<= main_~y~0 88) (<= 88 main_~y~0))) (and (<= main_~y~0 50) (<= main_~x~0 50) (<= 50 main_~y~0)) (and (<= 80 main_~x~0) (and (<= main_~x~0 80) (<= 80 main_~y~0) (<= main_~y~0 80))) (and (<= 94 main_~x~0) (and (<= main_~x~0 94) (<= main_~y~0 94) (<= 94 main_~y~0))) (and (<= 89 main_~x~0) (and (<= 89 main_~y~0) (<= main_~y~0 89) (<= main_~x~0 89))) (and (and (<= 86 main_~y~0) (<= main_~x~0 86) (<= main_~y~0 86)) (<= 86 main_~x~0)) (and (<= 58 main_~x~0) (and (<= main_~x~0 58) (<= main_~y~0 58) (<= 58 main_~y~0))) (and (and (<= main_~x~0 91) (<= 91 main_~y~0) (<= main_~y~0 91)) (<= 91 main_~x~0)) (and (and (<= 52 main_~y~0) (<= main_~y~0 52) (<= main_~x~0 52)) (<= 52 main_~x~0)) (and (<= 93 main_~x~0) (and (<= main_~x~0 93) (<= 93 main_~y~0) (<= main_~y~0 93))) (and (<= 74 main_~x~0) (and (<= 74 main_~y~0) (<= main_~y~0 74) (<= main_~x~0 74))) (and (and (<= main_~y~0 71) (<= main_~x~0 71) (<= 71 main_~y~0)) (<= 71 main_~x~0)) (and (<= 57 main_~x~0) (and (<= 57 main_~y~0) (<= main_~x~0 57) (<= main_~y~0 57))) (and (<= 97 main_~x~0) (and (<= 97 main_~y~0) (<= main_~x~0 97) (<= main_~y~0 97))) (and (and (<= main_~x~0 81) (<= 81 main_~y~0) (<= main_~y~0 81)) (<= 81 main_~x~0)) (and (<= 84 main_~x~0) (and (<= main_~y~0 84) (<= 84 main_~y~0) (<= main_~x~0 84))) (and (and (<= 96 main_~y~0) (<= main_~x~0 96) (<= main_~y~0 96)) (<= 96 main_~x~0)) (and (<= 83 main_~x~0) (and (<= main_~y~0 83) (<= 83 main_~y~0) (<= main_~x~0 83))) (and (<= 62 main_~x~0) (and (<= main_~y~0 62) (<= main_~x~0 62) (<= 62 main_~y~0))) (and (and (<= main_~x~0 98) (<= main_~y~0 98) (<= 98 main_~y~0)) (<= 98 main_~x~0)) (and (and (<= 75 main_~y~0) (<= main_~x~0 75) (<= main_~y~0 75)) (<= 75 main_~x~0)) (and (and (<= 82 main_~y~0) (<= main_~y~0 82) (<= main_~x~0 82)) (<= 82 main_~x~0))) [2018-11-07 16:48:30,712 INFO L421 ceAbstractionStarter]: At program point L13-3(lines 13 20) the Hoare annotation is: (and (<= main_~y~0 100) (< 99 main_~y~0)) [2018-11-07 16:48:30,712 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 16:48:30,712 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:48:30,712 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 16:48:30,712 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 16:48:30,712 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 16:48:30,713 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:48:30,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:48:30 BoogieIcfgContainer [2018-11-07 16:48:30,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:48:30,739 INFO L168 Benchmark]: Toolchain (without parser) took 143127.99 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-11-07 16:48:30,740 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:48:30,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:48:30,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.58 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:48:30,741 INFO L168 Benchmark]: Boogie Preprocessor took 30.55 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:48:30,741 INFO L168 Benchmark]: RCFGBuilder took 365.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:48:30,742 INFO L168 Benchmark]: TraceAbstraction took 142396.65 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 375.9 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -396.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 16:48:30,744 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 306.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.55 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 365.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 142396.65 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 375.9 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -396.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((x <= 99 && 99 <= y) && y <= 99) && 99 <= x) || (((y <= 92 && 92 <= y) && x <= 92) && 92 <= x)) || (65 <= x && (y <= 65 && 65 <= y) && x <= 65)) || ((y <= 100 && 99 < y) && 100 <= x)) || (64 <= x && (x <= 64 && 64 <= y) && y <= 64)) || (76 <= x && (y <= 76 && x <= 76) && 76 <= y)) || (87 <= x && (x <= 87 && y <= 87) && 87 <= y)) || (((y <= 78 && 78 <= y) && x <= 78) && 78 <= x)) || (72 <= x && (y <= 72 && x <= 72) && 72 <= y)) || (((y <= 69 && 69 <= y) && x <= 69) && 69 <= x)) || (60 <= x && (x <= 60 && y <= 60) && 60 <= y)) || (67 <= x && (y <= 67 && x <= 67) && 67 <= y)) || (((y <= 55 && 55 <= y) && x <= 55) && 55 <= x)) || (((73 <= y && x <= 73) && y <= 73) && 73 <= x)) || (66 <= x && (y <= 66 && 66 <= y) && x <= 66)) || (((x <= 70 && y <= 70) && 70 <= y) && 70 <= x)) || (((x <= 95 && y <= 95) && 95 <= y) && 95 <= x)) || (((90 <= y && y <= 90) && x <= 90) && 90 <= x)) || (((y <= 59 && x <= 59) && 59 <= y) && 59 <= x)) || (85 <= x && (85 <= y && x <= 85) && y <= 85)) || (63 <= x && (y <= 63 && x <= 63) && 63 <= y)) || (((y <= 77 && x <= 77) && 77 <= y) && 77 <= x)) || (53 <= x && (y <= 53 && x <= 53) && 53 <= y)) || (((x <= 79 && y <= 79) && 79 <= y) && 79 <= x)) || (68 <= x && (68 <= y && y <= 68) && x <= 68)) || (51 <= x && (51 <= y && x <= 51) && y <= 51)) || (54 <= x && (x <= 54 && 54 <= y) && y <= 54)) || (((56 <= y && x <= 56) && y <= 56) && 56 <= x)) || (61 <= x && (y <= 61 && 61 <= y) && x <= 61)) || (88 <= x && (x <= 88 && y <= 88) && 88 <= y)) || ((y <= 50 && x <= 50) && 50 <= y)) || (80 <= x && (x <= 80 && 80 <= y) && y <= 80)) || (94 <= x && (x <= 94 && y <= 94) && 94 <= y)) || (89 <= x && (89 <= y && y <= 89) && x <= 89)) || (((86 <= y && x <= 86) && y <= 86) && 86 <= x)) || (58 <= x && (x <= 58 && y <= 58) && 58 <= y)) || (((x <= 91 && 91 <= y) && y <= 91) && 91 <= x)) || (((52 <= y && y <= 52) && x <= 52) && 52 <= x)) || (93 <= x && (x <= 93 && 93 <= y) && y <= 93)) || (74 <= x && (74 <= y && y <= 74) && x <= 74)) || (((y <= 71 && x <= 71) && 71 <= y) && 71 <= x)) || (57 <= x && (57 <= y && x <= 57) && y <= 57)) || (97 <= x && (97 <= y && x <= 97) && y <= 97)) || (((x <= 81 && 81 <= y) && y <= 81) && 81 <= x)) || (84 <= x && (y <= 84 && 84 <= y) && x <= 84)) || (((96 <= y && x <= 96) && y <= 96) && 96 <= x)) || (83 <= x && (y <= 83 && 83 <= y) && x <= 83)) || (62 <= x && (y <= 62 && x <= 62) && 62 <= y)) || (((x <= 98 && y <= 98) && 98 <= y) && 98 <= x)) || (((75 <= y && x <= 75) && y <= 75) && 75 <= x)) || (((82 <= y && y <= 82) && x <= 82) && 82 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 142.2s OverallTime, 65 OverallIterations, 102 TraceHistogramMax, 19.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 958 SDtfs, 1348 SDslu, 18538 SDs, 0 SdLazy, 9435 SolverSat, 2379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 19194 GetRequests, 15189 SyntacticMatches, 1015 SemanticMatches, 2990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106812 ImplicationChecksByTransitivity, 104.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.3076923076923077 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 65 MinimizatonAttempts, 4003 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 71 PreInvPairs, 173 NumberOfFragments, 720 HoareAnnotationTreeSize, 71 FomulaSimplifications, 14805 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 110.0s InterpolantComputationTime, 17699 NumberOfCodeBlocks, 16355 NumberOfCodeBlocksAsserted, 548 NumberOfCheckSat, 26187 ConstructedInterpolants, 0 QuantifiedInterpolants, 12342997 SizeOfPredicates, 49 NumberOfNonLiveVariables, 14311 ConjunctsInSsa, 1919 ConjunctsInUnsatCore, 187 InterpolantComputations, 3 PerfectInterpolantSequences, 368759/735027 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...