java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:46:19,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:46:19,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:46:19,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:46:19,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:46:19,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:46:19,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:46:19,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:46:19,806 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:46:19,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:46:19,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:46:19,812 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:46:19,814 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:46:19,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:46:19,819 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:46:19,820 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:46:19,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:46:19,823 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:46:19,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:46:19,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:46:19,837 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:46:19,839 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:46:19,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:46:19,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:46:19,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:46:19,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:46:19,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:46:19,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:46:19,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:46:19,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:46:19,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:46:19,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:46:19,852 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:46:19,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:46:19,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:46:19,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:46:19,856 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:46:19,882 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:46:19,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:46:19,883 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:46:19,884 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:46:19,884 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:46:19,885 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:46:19,885 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:46:19,885 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:46:19,885 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:46:19,885 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:46:19,886 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:46:19,886 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:46:19,886 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:46:19,887 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:46:19,887 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:46:19,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:46:19,888 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:46:19,888 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:46:19,888 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:46:19,888 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:46:19,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:46:19,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:46:19,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:46:19,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:46:19,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:46:19,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:46:19,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:46:19,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:46:19,891 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:46:19,892 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:46:19,892 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:46:19,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:46:19,892 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:46:19,892 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:46:19,893 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:46:19,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:46:19,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:46:19,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:46:19,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:46:19,987 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:46:19,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c [2018-11-12 20:46:20,057 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01c70ff9/45e59b51ad1a47f28e6b428d2012f878/FLAGf01f2292e [2018-11-12 20:46:20,532 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:46:20,532 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c [2018-11-12 20:46:20,539 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01c70ff9/45e59b51ad1a47f28e6b428d2012f878/FLAGf01f2292e [2018-11-12 20:46:20,552 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01c70ff9/45e59b51ad1a47f28e6b428d2012f878 [2018-11-12 20:46:20,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:46:20,564 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:46:20,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:46:20,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:46:20,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:46:20,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30414706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20, skipping insertion in model container [2018-11-12 20:46:20,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:46:20,609 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:46:20,808 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:46:20,812 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:46:20,829 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:46:20,848 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:46:20,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20 WrapperNode [2018-11-12 20:46:20,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:46:20,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:46:20,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:46:20,850 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:46:20,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:46:20,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:46:20,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:46:20,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:46:20,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... [2018-11-12 20:46:20,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:46:20,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:46:20,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:46:20,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:46:20,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:46:21,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:46:21,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:46:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:46:21,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:46:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:46:21,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:46:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:46:21,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:46:21,266 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:46:21,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:46:21 BoogieIcfgContainer [2018-11-12 20:46:21,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:46:21,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:46:21,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:46:21,271 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:46:21,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:46:20" (1/3) ... [2018-11-12 20:46:21,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aafde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:46:21, skipping insertion in model container [2018-11-12 20:46:21,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:46:20" (2/3) ... [2018-11-12 20:46:21,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aafde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:46:21, skipping insertion in model container [2018-11-12 20:46:21,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:46:21" (3/3) ... [2018-11-12 20:46:21,274 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_true-unreach-call1.c [2018-11-12 20:46:21,283 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:46:21,290 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:46:21,305 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:46:21,345 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:46:21,345 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:46:21,345 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:46:21,346 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:46:21,346 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:46:21,347 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:46:21,347 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:46:21,347 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:46:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-12 20:46:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:46:21,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:21,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:21,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:21,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:21,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-12 20:46:21,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:21,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:21,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:21,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:21,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:21,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:46:21,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:46:21,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:46:21,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:46:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:46:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:46:21,523 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-12 20:46:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:21,545 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-12 20:46:21,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:46:21,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:46:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:21,555 INFO L225 Difference]: With dead ends: 30 [2018-11-12 20:46:21,555 INFO L226 Difference]: Without dead ends: 13 [2018-11-12 20:46:21,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:46:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-12 20:46:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-12 20:46:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-12 20:46:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-12 20:46:21,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-12 20:46:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:21,598 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-12 20:46:21,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:46:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-12 20:46:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:46:21,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:21,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:21,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:21,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-12 20:46:21,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:21,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:21,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:21,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:46:21,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:46:21,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:46:21,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:46:21,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:46:21,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:46:21,763 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-12 20:46:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:21,829 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-12 20:46:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:46:21,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:46:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:21,831 INFO L225 Difference]: With dead ends: 24 [2018-11-12 20:46:21,831 INFO L226 Difference]: Without dead ends: 16 [2018-11-12 20:46:21,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:46:21,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-12 20:46:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-12 20:46:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-12 20:46:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-12 20:46:21,838 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-12 20:46:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:21,839 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-12 20:46:21,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:46:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-12 20:46:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:46:21,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:21,840 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:21,845 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:21,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:21,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-12 20:46:21,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:21,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:21,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:21,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:21,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:21,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:21,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:21,972 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-12 20:46:21,975 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:46:22,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:46:22,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:46:22,098 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:46:22,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:46:22,250 INFO L272 AbstractInterpreter]: Visited 13 different actions 69 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Performed 164 root evaluator evaluations with a maximum evaluation depth of 4. Performed 164 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-12 20:46:22,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:22,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:46:22,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:22,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:22,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:22,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:22,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:22,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:22,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:22,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 9 [2018-11-12 20:46:22,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:22,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:46:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:46:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:46:22,658 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2018-11-12 20:46:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:22,809 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-12 20:46:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:46:22,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-12 20:46:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:22,813 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:46:22,813 INFO L226 Difference]: Without dead ends: 19 [2018-11-12 20:46:22,815 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:46:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-12 20:46:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-12 20:46:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-12 20:46:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-12 20:46:22,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-12 20:46:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:22,824 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-12 20:46:22,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:46:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-12 20:46:22,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:46:22,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:22,825 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:22,825 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:22,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:22,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-12 20:46:22,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:22,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:22,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:22,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:22,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:22,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:22,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:22,985 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:22,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:22,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:22,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:22,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:22,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:23,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:46:23,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:23,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:46:23,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:46:23,200 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:46:23,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 6] imperfect sequences [5] total 10 [2018-11-12 20:46:23,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:46:23,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:46:23,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:46:23,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:46:23,203 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-12 20:46:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:23,247 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-12 20:46:23,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:46:23,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-12 20:46:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:23,249 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:46:23,249 INFO L226 Difference]: Without dead ends: 22 [2018-11-12 20:46:23,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:46:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-12 20:46:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-12 20:46:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-12 20:46:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-12 20:46:23,259 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2018-11-12 20:46:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:23,259 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-12 20:46:23,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:46:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-12 20:46:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:46:23,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:23,261 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:23,262 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:23,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:23,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1801011421, now seen corresponding path program 1 times [2018-11-12 20:46:23,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:23,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:23,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:23,509 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-12 20:46:23,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:23,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:23,510 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-12 20:46:23,510 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:46:23,512 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:46:23,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:46:23,516 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:46:23,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:46:23,638 INFO L272 AbstractInterpreter]: Visited 14 different actions 78 times. Merged at 5 different actions 30 times. Widened at 2 different actions 4 times. Performed 224 root evaluator evaluations with a maximum evaluation depth of 4. Performed 224 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-12 20:46:23,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:23,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:46:23,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:23,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:23,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:23,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:23,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:23,791 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-12 20:46:23,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:23,915 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-12 20:46:23,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:23,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2018-11-12 20:46:23,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:23,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:46:23,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:46:23,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:46:23,938 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-12 20:46:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:24,280 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-12 20:46:24,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:46:24,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-12 20:46:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:24,283 INFO L225 Difference]: With dead ends: 34 [2018-11-12 20:46:24,283 INFO L226 Difference]: Without dead ends: 24 [2018-11-12 20:46:24,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:46:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-12 20:46:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-12 20:46:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-12 20:46:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-12 20:46:24,290 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-11-12 20:46:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:24,291 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-12 20:46:24,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:46:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-12 20:46:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:46:24,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:24,292 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:24,292 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:24,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2092450784, now seen corresponding path program 2 times [2018-11-12 20:46:24,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:24,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:24,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:24,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:24,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:24,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:24,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:24,450 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:24,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:24,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:24,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:24,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:24,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:24,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:46:24,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:24,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:46:24,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:46:24,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:24,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 7] total 14 [2018-11-12 20:46:24,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:24,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:46:24,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:46:24,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:46:24,742 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2018-11-12 20:46:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:27,180 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-12 20:46:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:46:27,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-12 20:46:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:27,181 INFO L225 Difference]: With dead ends: 44 [2018-11-12 20:46:27,181 INFO L226 Difference]: Without dead ends: 34 [2018-11-12 20:46:27,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:46:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-12 20:46:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-12 20:46:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-12 20:46:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-12 20:46:27,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-11-12 20:46:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:27,188 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-12 20:46:27,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:46:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-12 20:46:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:46:27,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:27,190 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:27,191 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:27,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1050905282, now seen corresponding path program 3 times [2018-11-12 20:46:27,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:27,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:27,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:27,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:27,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:27,396 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:27,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:27,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:27,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:27,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:27,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:27,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:27,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:27,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:27,488 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-12 20:46:27,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:27,715 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-12 20:46:27,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:27,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2018-11-12 20:46:27,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:27,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:46:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:46:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:46:27,744 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-12 20:46:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:27,841 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-12 20:46:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:46:27,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-12 20:46:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:27,843 INFO L225 Difference]: With dead ends: 46 [2018-11-12 20:46:27,844 INFO L226 Difference]: Without dead ends: 33 [2018-11-12 20:46:27,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:46:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-12 20:46:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-12 20:46:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-12 20:46:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-12 20:46:27,851 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2018-11-12 20:46:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:27,851 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-12 20:46:27,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:46:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-12 20:46:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-12 20:46:27,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:27,852 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:27,853 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:27,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash -306121381, now seen corresponding path program 4 times [2018-11-12 20:46:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:27,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:27,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:28,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:28,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:28,347 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:28,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:28,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:28,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:28,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:28,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:28,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:28,507 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-12 20:46:28,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:28,965 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-12 20:46:28,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:28,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2018-11-12 20:46:28,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:28,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:46:28,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:46:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:46:28,988 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2018-11-12 20:46:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:29,124 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-12 20:46:29,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:46:29,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-12 20:46:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:29,128 INFO L225 Difference]: With dead ends: 49 [2018-11-12 20:46:29,128 INFO L226 Difference]: Without dead ends: 36 [2018-11-12 20:46:29,128 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:46:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-12 20:46:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-12 20:46:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:46:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-12 20:46:29,134 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 32 [2018-11-12 20:46:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:29,134 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-12 20:46:29,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:46:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-12 20:46:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:46:29,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:29,135 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:29,136 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:29,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash -249977826, now seen corresponding path program 5 times [2018-11-12 20:46:29,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:29,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:29,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:29,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:29,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:29,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:29,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:29,327 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:29,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:29,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:29,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:29,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:29,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:29,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-12 20:46:29,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:29,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-12 20:46:29,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-12 20:46:29,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:29,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 8] total 20 [2018-11-12 20:46:29,594 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:29,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:46:29,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:46:29,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:46:29,595 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 14 states. [2018-11-12 20:46:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:30,205 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-12 20:46:30,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:46:30,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-12 20:46:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:30,209 INFO L225 Difference]: With dead ends: 59 [2018-11-12 20:46:30,209 INFO L226 Difference]: Without dead ends: 46 [2018-11-12 20:46:30,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:46:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-12 20:46:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-12 20:46:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-12 20:46:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-12 20:46:30,220 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2018-11-12 20:46:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:30,221 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-12 20:46:30,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:46:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-12 20:46:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:46:30,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:30,223 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:30,223 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:30,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 607533056, now seen corresponding path program 6 times [2018-11-12 20:46:30,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:30,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:30,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:30,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:30,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:30,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:30,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:30,521 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:30,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:30,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:30,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:30,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:30,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:30,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:30,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:30,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:30,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:31,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:31,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2018-11-12 20:46:31,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:31,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:46:31,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:46:31,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:46:31,215 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2018-11-12 20:46:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:31,475 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-12 20:46:31,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:46:31,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-12 20:46:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:31,479 INFO L225 Difference]: With dead ends: 61 [2018-11-12 20:46:31,479 INFO L226 Difference]: Without dead ends: 45 [2018-11-12 20:46:31,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:46:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-12 20:46:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-12 20:46:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-12 20:46:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-12 20:46:31,486 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2018-11-12 20:46:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:31,488 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-12 20:46:31,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:46:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-12 20:46:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-12 20:46:31,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:31,489 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:31,489 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:31,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:31,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1655862429, now seen corresponding path program 7 times [2018-11-12 20:46:31,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:31,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:31,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:31,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:31,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:31,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:31,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:31,805 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:31,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:31,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:31,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:31,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:31,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:31,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:32,071 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-12 20:46:32,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:32,623 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-12 20:46:32,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:32,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 24 [2018-11-12 20:46:32,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:32,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:46:32,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:46:32,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:46:32,645 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2018-11-12 20:46:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:32,869 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-12 20:46:32,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:46:32,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-12 20:46:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:32,871 INFO L225 Difference]: With dead ends: 64 [2018-11-12 20:46:32,871 INFO L226 Difference]: Without dead ends: 48 [2018-11-12 20:46:32,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:46:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-12 20:46:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-12 20:46:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-12 20:46:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-12 20:46:32,878 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 44 [2018-11-12 20:46:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:32,879 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-12 20:46:32,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:46:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-12 20:46:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:46:32,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:32,880 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:32,880 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:32,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:32,881 INFO L82 PathProgramCache]: Analyzing trace with hash -565963040, now seen corresponding path program 8 times [2018-11-12 20:46:32,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:32,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:32,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:33,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:33,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:33,445 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:33,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:33,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:33,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:33,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:33,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:33,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:46:33,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:33,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 20:46:33,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 20:46:34,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:34,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 9] total 26 [2018-11-12 20:46:34,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:34,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:46:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:46:34,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:46:34,125 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 19 states. [2018-11-12 20:46:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:46,302 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-12 20:46:46,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:46:46,303 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-12 20:46:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:46,305 INFO L225 Difference]: With dead ends: 74 [2018-11-12 20:46:46,305 INFO L226 Difference]: Without dead ends: 58 [2018-11-12 20:46:46,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=201, Invalid=610, Unknown=1, NotChecked=0, Total=812 [2018-11-12 20:46:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-12 20:46:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-12 20:46:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-12 20:46:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-12 20:46:46,313 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 47 [2018-11-12 20:46:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:46,313 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-12 20:46:46,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:46:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-12 20:46:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-12 20:46:46,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:46,314 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:46,315 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:46,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:46,315 INFO L82 PathProgramCache]: Analyzing trace with hash -829748866, now seen corresponding path program 9 times [2018-11-12 20:46:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:46,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:46,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:46,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:46,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:46,564 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:46,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:46,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:46,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:46,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:46,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:46,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:46,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:46,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:46,671 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-12 20:46:46,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:47,135 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-12 20:46:47,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:47,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 29 [2018-11-12 20:46:47,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:47,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:46:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:46:47,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:46:47,156 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 17 states. [2018-11-12 20:46:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:47,545 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-11-12 20:46:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:46:47,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-12 20:46:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:47,547 INFO L225 Difference]: With dead ends: 79 [2018-11-12 20:46:47,547 INFO L226 Difference]: Without dead ends: 60 [2018-11-12 20:46:47,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:46:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-12 20:46:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-12 20:46:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:46:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-12 20:46:47,561 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 53 [2018-11-12 20:46:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:47,561 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-12 20:46:47,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:46:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-12 20:46:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:46:47,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:47,562 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:47,562 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:47,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:47,563 INFO L82 PathProgramCache]: Analyzing trace with hash 794925150, now seen corresponding path program 10 times [2018-11-12 20:46:47,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:47,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:47,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:47,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:47,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:48,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:48,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:48,380 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:48,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:48,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:48,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:48,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:48,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:48,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:46:48,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:46:49,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:49,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 33 [2018-11-12 20:46:49,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:49,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:46:49,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:46:49,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:46:49,531 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 19 states. [2018-11-12 20:46:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:49,929 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-12 20:46:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:46:49,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-12 20:46:49,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:49,931 INFO L225 Difference]: With dead ends: 85 [2018-11-12 20:46:49,931 INFO L226 Difference]: Without dead ends: 66 [2018-11-12 20:46:49,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:46:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-12 20:46:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-12 20:46:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-12 20:46:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-12 20:46:49,941 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 59 [2018-11-12 20:46:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:49,941 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-12 20:46:49,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:46:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-12 20:46:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-12 20:46:49,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:49,943 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:49,943 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:49,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:49,943 INFO L82 PathProgramCache]: Analyzing trace with hash 369721150, now seen corresponding path program 11 times [2018-11-12 20:46:49,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:49,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:49,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:49,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:50,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:50,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:50,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:50,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:50,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:50,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:50,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:50,381 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:50,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-12 20:46:50,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:50,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-12 20:46:50,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-12 20:46:50,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:50,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 10] total 34 [2018-11-12 20:46:50,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:50,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:46:50,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:46:50,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:46:50,937 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 26 states. [2018-11-12 20:46:56,304 WARN L179 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:47:00,416 WARN L179 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:47:02,970 WARN L179 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-12 20:47:07,782 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:47:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:16,038 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2018-11-12 20:47:16,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:47:16,038 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-11-12 20:47:16,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:16,039 INFO L225 Difference]: With dead ends: 101 [2018-11-12 20:47:16,039 INFO L226 Difference]: Without dead ends: 82 [2018-11-12 20:47:16,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=401, Invalid=1156, Unknown=3, NotChecked=0, Total=1560 [2018-11-12 20:47:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-12 20:47:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2018-11-12 20:47:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-12 20:47:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-12 20:47:16,052 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 65 [2018-11-12 20:47:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:16,053 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-12 20:47:16,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:47:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-12 20:47:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-12 20:47:16,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:16,054 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:16,055 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:16,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash 10718589, now seen corresponding path program 12 times [2018-11-12 20:47:16,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:16,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:16,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:16,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:16,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:47:16,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:16,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:16,597 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:16,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:16,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:16,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:47:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:47:16,613 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:47:16,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:47:16,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:16,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:47:16,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:47:18,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:18,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 45 [2018-11-12 20:47:18,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:18,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:47:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:47:18,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:47:18,672 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 24 states. [2018-11-12 20:47:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:19,292 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-12 20:47:19,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:47:19,292 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-12 20:47:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:19,293 INFO L225 Difference]: With dead ends: 100 [2018-11-12 20:47:19,294 INFO L226 Difference]: Without dead ends: 78 [2018-11-12 20:47:19,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:47:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-12 20:47:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-12 20:47:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-12 20:47:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-11-12 20:47:19,310 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 74 [2018-11-12 20:47:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:19,310 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-11-12 20:47:19,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:47:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-12 20:47:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-12 20:47:19,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:19,312 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:19,312 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:19,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:19,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1880758400, now seen corresponding path program 13 times [2018-11-12 20:47:19,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:19,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:19,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:19,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:19,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:47:20,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:20,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:20,502 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:20,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:20,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:20,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:47:20,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:20,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:47:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:20,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:47:20,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:47:22,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:22,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 44 [2018-11-12 20:47:22,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:22,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:47:22,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:47:22,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:47:22,222 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 25 states. [2018-11-12 20:47:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:22,999 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-11-12 20:47:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:47:22,999 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-12 20:47:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:23,000 INFO L225 Difference]: With dead ends: 103 [2018-11-12 20:47:23,000 INFO L226 Difference]: Without dead ends: 81 [2018-11-12 20:47:23,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:47:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-12 20:47:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-12 20:47:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-12 20:47:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-11-12 20:47:23,011 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 77 [2018-11-12 20:47:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:23,011 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-11-12 20:47:23,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:47:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-12 20:47:23,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-12 20:47:23,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:23,012 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 18, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:23,012 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:23,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:23,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2078995811, now seen corresponding path program 14 times [2018-11-12 20:47:23,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:23,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:23,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:23,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:23,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:47:24,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:24,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:24,063 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:24,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:24,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:24,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:47:24,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:47:24,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:47:24,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:47:24,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:24,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-12 20:47:24,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-12 20:47:24,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:24,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8, 11] total 41 [2018-11-12 20:47:24,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:24,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:47:24,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:47:24,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:47:24,931 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 32 states. [2018-11-12 20:47:26,670 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:47:33,183 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:47:41,319 WARN L179 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:47:57,202 WARN L179 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:48:07,147 WARN L179 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-12 20:48:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:07,573 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2018-11-12 20:48:07,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:48:07,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 80 [2018-11-12 20:48:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:07,574 INFO L225 Difference]: With dead ends: 119 [2018-11-12 20:48:07,574 INFO L226 Difference]: Without dead ends: 97 [2018-11-12 20:48:07,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=590, Invalid=1757, Unknown=5, NotChecked=0, Total=2352 [2018-11-12 20:48:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-12 20:48:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-11-12 20:48:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-12 20:48:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-11-12 20:48:07,583 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 80 [2018-11-12 20:48:07,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:07,583 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-11-12 20:48:07,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:48:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-12 20:48:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-12 20:48:07,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:07,585 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:07,585 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:07,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:07,585 INFO L82 PathProgramCache]: Analyzing trace with hash 59221243, now seen corresponding path program 15 times [2018-11-12 20:48:07,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:07,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:07,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:48:07,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:07,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:48:08,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:08,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:08,651 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:08,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:08,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:08,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:48:08,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:48:08,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:48:08,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:48:08,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:48:08,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:48:08,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:48:10,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:10,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 23] total 49 [2018-11-12 20:48:10,573 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:10,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:48:10,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:48:10,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:48:10,575 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 28 states. [2018-11-12 20:48:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:11,393 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-11-12 20:48:11,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:48:11,394 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-12 20:48:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:11,395 INFO L225 Difference]: With dead ends: 118 [2018-11-12 20:48:11,395 INFO L226 Difference]: Without dead ends: 93 [2018-11-12 20:48:11,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:48:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-12 20:48:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-12 20:48:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-12 20:48:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-11-12 20:48:11,404 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 86 [2018-11-12 20:48:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:11,404 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-11-12 20:48:11,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:48:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-11-12 20:48:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-12 20:48:11,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:11,405 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:11,406 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:11,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:11,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1341754853, now seen corresponding path program 16 times [2018-11-12 20:48:11,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:11,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:48:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:11,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:48:12,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:12,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:12,185 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:12,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:12,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:12,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:48:12,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:48:12,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:48:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:12,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:48:12,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:48:14,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:14,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 25] total 53 [2018-11-12 20:48:14,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:14,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:48:14,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:48:14,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:48:14,654 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 30 states. [2018-11-12 20:48:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:48:15,583 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-11-12 20:48:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:48:15,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-12 20:48:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:48:15,585 INFO L225 Difference]: With dead ends: 124 [2018-11-12 20:48:15,585 INFO L226 Difference]: Without dead ends: 99 [2018-11-12 20:48:15,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:48:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-12 20:48:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-12 20:48:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-12 20:48:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-11-12 20:48:15,597 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 92 [2018-11-12 20:48:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:48:15,597 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-11-12 20:48:15,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:48:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-11-12 20:48:15,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-12 20:48:15,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:48:15,599 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 23, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:48:15,599 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:48:15,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:48:15,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2143361221, now seen corresponding path program 17 times [2018-11-12 20:48:15,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:48:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:15,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:48:15,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:48:15,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:48:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:48:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 58 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:48:16,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:16,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:48:16,622 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:48:16,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:48:16,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:48:16,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:48:16,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:48:16,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:48:57,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-12 20:48:57,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:48:57,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:48:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-12 20:48:57,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:48:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-12 20:48:58,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:48:58,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9, 12] total 49 [2018-11-12 20:48:58,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:48:58,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:48:58,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:48:58,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:48:58,051 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 39 states. [2018-11-12 20:49:04,006 WARN L179 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-12 20:49:06,841 WARN L179 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:49:24,424 WARN L179 SmtUtils]: Spent 9.21 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:49:32,540 WARN L179 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:49:57,103 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:50:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:50:23,950 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2018-11-12 20:50:23,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:50:23,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 98 [2018-11-12 20:50:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:50:23,951 INFO L225 Difference]: With dead ends: 141 [2018-11-12 20:50:23,951 INFO L226 Difference]: Without dead ends: 116 [2018-11-12 20:50:23,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 184 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 63.3s TimeCoverageRelationStatistics Valid=842, Invalid=2458, Unknown=6, NotChecked=0, Total=3306 [2018-11-12 20:50:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-12 20:50:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-11-12 20:50:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-12 20:50:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-11-12 20:50:23,962 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 98 [2018-11-12 20:50:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:50:23,962 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-11-12 20:50:23,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:50:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-11-12 20:50:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-12 20:50:23,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:50:23,963 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 25, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:50:23,963 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:50:23,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:50:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1159676448, now seen corresponding path program 18 times [2018-11-12 20:50:23,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:50:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:50:23,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:50:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:50:23,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:50:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:50:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 155 proven. 1395 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:50:24,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:50:24,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:50:24,957 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:50:24,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:50:24,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:50:24,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:50:24,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:50:24,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:50:24,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:50:24,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:50:24,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:50:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:50:25,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:50:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:50:28,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:50:28,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28, 29] total 61 [2018-11-12 20:50:28,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:50:28,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:50:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:50:28,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1015, Invalid=2645, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:50:28,083 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 34 states. [2018-11-12 20:50:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:50:29,148 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2018-11-12 20:50:29,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:50:29,152 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 107 [2018-11-12 20:50:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:50:29,153 INFO L225 Difference]: With dead ends: 142 [2018-11-12 20:50:29,153 INFO L226 Difference]: Without dead ends: 114 [2018-11-12 20:50:29,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1015, Invalid=2645, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:50:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-12 20:50:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-12 20:50:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-12 20:50:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-11-12 20:50:29,164 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 107 [2018-11-12 20:50:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:50:29,164 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-11-12 20:50:29,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:50:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-12 20:50:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-12 20:50:29,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:50:29,165 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 27, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:50:29,165 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:50:29,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:50:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash -628496128, now seen corresponding path program 19 times [2018-11-12 20:50:29,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:50:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:50:29,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:50:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:50:29,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:50:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:50:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 165 proven. 1584 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:50:30,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:50:30,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:50:30,470 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:50:30,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:50:30,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:50:30,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:50:30,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:50:30,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:50:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:50:30,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:50:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 560 proven. 1134 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:50:30,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:50:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 560 proven. 1134 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:50:33,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:50:33,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30, 31] total 65 [2018-11-12 20:50:33,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:50:33,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:50:33,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:50:33,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1147, Invalid=3013, Unknown=0, NotChecked=0, Total=4160 [2018-11-12 20:50:33,811 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 36 states. [2018-11-12 20:50:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:50:35,048 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2018-11-12 20:50:35,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:50:35,049 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 113 [2018-11-12 20:50:35,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:50:35,050 INFO L225 Difference]: With dead ends: 148 [2018-11-12 20:50:35,050 INFO L226 Difference]: Without dead ends: 120 [2018-11-12 20:50:35,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1147, Invalid=3013, Unknown=0, NotChecked=0, Total=4160 [2018-11-12 20:50:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-12 20:50:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-12 20:50:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-12 20:50:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-11-12 20:50:35,062 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 113 [2018-11-12 20:50:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:50:35,062 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-11-12 20:50:35,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:50:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-11-12 20:50:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:50:35,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:50:35,063 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 29, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:50:35,063 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:50:35,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:50:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash -866916384, now seen corresponding path program 20 times [2018-11-12 20:50:35,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:50:35,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:50:35,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:50:35,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:50:35,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:50:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:50:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 175 proven. 1785 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:50:36,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:50:36,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:50:36,629 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:50:36,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:50:36,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:50:36,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:50:36,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:50:36,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown