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-EXP.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:29:28,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:29:28,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:29:28,854 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:29:28,855 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:29:28,856 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:29:28,857 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:29:28,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:29:28,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:29:28,861 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:29:28,862 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:29:28,862 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:29:28,863 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:29:28,864 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:29:28,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:29:28,866 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:29:28,867 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:29:28,869 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:29:28,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:29:28,872 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:29:28,874 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:29:28,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:29:28,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:29:28,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:29:28,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:29:28,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:29:28,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:29:28,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:29:28,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:29:28,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:29:28,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:29:28,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:29:28,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:29:28,890 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:29:28,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:29:28,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:29:28,894 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:29:28,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:29:28,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:29:28,916 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:29:28,916 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:29:28,916 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:29:28,916 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:29:28,916 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:29:28,917 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:29:28,917 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:29:28,917 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:29:28,917 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:29:28,917 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:29:28,918 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:29:28,918 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:29:28,918 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:29:28,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:29:28,919 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:29:28,919 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:29:28,919 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:29:28,919 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:29:28,919 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:29:28,920 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:29:28,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:29:28,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:29:28,920 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:29:28,920 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:29:28,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:29:28,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:29:28,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:29:28,921 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:29:28,922 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:29:28,922 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:29:28,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:29:28,922 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:29:28,922 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:29:28,922 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:29:28,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:29:28,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:29:28,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:29:28,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:29:28,994 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:29:28,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i [2018-11-07 10:29:29,059 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9f54fdd/63eef386d9734c019c2bd9b88f9d3b52/FLAG853c09afb [2018-11-07 10:29:29,528 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:29:29,529 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i [2018-11-07 10:29:29,535 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9f54fdd/63eef386d9734c019c2bd9b88f9d3b52/FLAG853c09afb [2018-11-07 10:29:29,551 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9f54fdd/63eef386d9734c019c2bd9b88f9d3b52 [2018-11-07 10:29:29,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:29:29,566 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:29:29,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:29:29,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:29:29,573 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:29:29,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ade47ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29, skipping insertion in model container [2018-11-07 10:29:29,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:29:29,612 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:29:29,854 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:29:29,859 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:29:29,886 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:29:29,917 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:29:29,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29 WrapperNode [2018-11-07 10:29:29,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:29:29,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:29:29,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:29:29,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:29:29,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:29:29,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:29:29,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:29:29,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:29:29,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... [2018-11-07 10:29:29,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:29:29,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:29:29,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:29:29,982 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:29:29,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:29:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:29:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:29:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:29:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:29:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:29:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:29:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:29:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:29:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:29:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:29:30,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:29:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:29:30,573 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:29:30,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:29:30 BoogieIcfgContainer [2018-11-07 10:29:30,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:29:30,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:29:30,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:29:30,578 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:29:30,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:29:29" (1/3) ... [2018-11-07 10:29:30,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60023e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:29:30, skipping insertion in model container [2018-11-07 10:29:30,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:29" (2/3) ... [2018-11-07 10:29:30,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60023e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:29:30, skipping insertion in model container [2018-11-07 10:29:30,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:29:30" (3/3) ... [2018-11-07 10:29:30,582 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call3_true-termination.i [2018-11-07 10:29:30,592 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:29:30,600 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:29:30,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:29:30,646 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:29:30,646 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:29:30,646 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:29:30,646 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:29:30,646 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:29:30,646 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:29:30,647 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:29:30,647 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:29:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-07 10:29:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:29:30,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:30,674 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:30,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:30,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1215083166, now seen corresponding path program 1 times [2018-11-07 10:29:30,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:30,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:30,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:30,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:30,734 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:30,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:29:30,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:29:30,818 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:30,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:29:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:29:30,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:29:30,842 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-07 10:29:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:30,866 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-07 10:29:30,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:29:30,868 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 10:29:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:30,877 INFO L225 Difference]: With dead ends: 48 [2018-11-07 10:29:30,877 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 10:29:30,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:29:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 10:29:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 10:29:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 10:29:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-07 10:29:30,921 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2018-11-07 10:29:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:30,922 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-07 10:29:30,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:29:30,922 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-07 10:29:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:29:30,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:30,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:30,923 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:30,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1495716299, now seen corresponding path program 1 times [2018-11-07 10:29:30,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:30,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:30,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:30,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:30,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:31,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:29:31,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:29:31,027 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:31,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:29:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:29:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:29:31,029 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 3 states. [2018-11-07 10:29:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:31,159 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-07 10:29:31,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:29:31,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 10:29:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:31,163 INFO L225 Difference]: With dead ends: 42 [2018-11-07 10:29:31,164 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 10:29:31,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:29:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 10:29:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-07 10:29:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 10:29:31,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-07 10:29:31,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2018-11-07 10:29:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:31,172 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-07 10:29:31,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:29:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-07 10:29:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 10:29:31,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:31,174 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:31,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:31,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash 37966098, now seen corresponding path program 1 times [2018-11-07 10:29:31,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:31,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:31,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:31,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:31,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:31,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:31,258 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:31,263 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 10:29:31,266 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [27], [28], [31], [43], [46], [48], [54], [55], [56], [58] [2018-11-07 10:29:31,312 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:29:31,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:29:31,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:29:31,483 INFO L272 AbstractInterpreter]: Visited 21 different actions 33 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-07 10:29:31,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:31,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:29:31,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:31,507 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:31,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:31,519 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:31,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:31,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:31,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:31,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 10:29:31,759 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:31,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:29:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:29:31,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:29:31,762 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-11-07 10:29:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:32,046 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-07 10:29:32,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:29:32,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-07 10:29:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:32,048 INFO L225 Difference]: With dead ends: 52 [2018-11-07 10:29:32,048 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 10:29:32,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:29:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 10:29:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2018-11-07 10:29:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-07 10:29:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-07 10:29:32,055 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2018-11-07 10:29:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:32,055 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-07 10:29:32,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:29:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-07 10:29:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:29:32,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:32,057 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:32,057 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:32,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:32,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1224904619, now seen corresponding path program 2 times [2018-11-07 10:29:32,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:32,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:32,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:32,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:32,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:29:32,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:32,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:32,199 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:32,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:32,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:32,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:32,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:32,212 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:32,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-07 10:29:32,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:32,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:29:32,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:29:32,427 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:29:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 11 [2018-11-07 10:29:32,427 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:32,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:29:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:29:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:29:32,429 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-11-07 10:29:32,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:32,550 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-07 10:29:32,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:29:32,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-07 10:29:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:32,553 INFO L225 Difference]: With dead ends: 38 [2018-11-07 10:29:32,553 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 10:29:32,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:29:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 10:29:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-07 10:29:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 10:29:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-07 10:29:32,561 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2018-11-07 10:29:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:32,561 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-07 10:29:32,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:29:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-07 10:29:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:29:32,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:32,563 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:32,564 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:32,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2066638414, now seen corresponding path program 1 times [2018-11-07 10:29:32,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:32,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:32,566 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:29:32,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:32,638 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:32,638 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 10:29:32,639 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [27], [28], [31], [33], [35], [43], [46], [48], [54], [55], [56], [58] [2018-11-07 10:29:32,641 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:29:32,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:29:32,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:29:32,716 INFO L272 AbstractInterpreter]: Visited 23 different actions 53 times. Merged at 10 different actions 20 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-07 10:29:32,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:32,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:29:32,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:32,724 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:32,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:32,735 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:32,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:29:32,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:29:32,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:32,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 10:29:32,921 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:32,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:29:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:29:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:29:32,923 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 6 states. [2018-11-07 10:29:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:33,260 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-07 10:29:33,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:29:33,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-07 10:29:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:33,263 INFO L225 Difference]: With dead ends: 64 [2018-11-07 10:29:33,264 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 10:29:33,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:29:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 10:29:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2018-11-07 10:29:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 10:29:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-07 10:29:33,278 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2018-11-07 10:29:33,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:33,278 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-07 10:29:33,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:29:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-07 10:29:33,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 10:29:33,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:33,284 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:33,284 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:33,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:33,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1430451663, now seen corresponding path program 2 times [2018-11-07 10:29:33,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:33,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:33,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:33,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:33,286 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:29:33,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:33,390 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:33,390 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:33,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:33,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:33,391 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:33,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:33,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:33,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:29:33,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:33,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:29:33,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:29:33,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:33,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-11-07 10:29:33,650 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:33,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:29:33,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:29:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:29:33,651 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-11-07 10:29:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:33,791 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-07 10:29:33,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:29:33,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-07 10:29:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:33,794 INFO L225 Difference]: With dead ends: 76 [2018-11-07 10:29:33,794 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 10:29:33,795 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:29:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 10:29:33,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-07 10:29:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 10:29:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-07 10:29:33,801 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 36 [2018-11-07 10:29:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:33,802 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-07 10:29:33,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:29:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-07 10:29:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 10:29:33,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:33,804 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:33,804 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:33,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:33,805 INFO L82 PathProgramCache]: Analyzing trace with hash -384882455, now seen corresponding path program 3 times [2018-11-07 10:29:33,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:33,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:33,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:33,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:33,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:29:33,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:33,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:33,969 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:33,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:33,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:33,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:33,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:33,980 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:34,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:34,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:34,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:29:34,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:29:34,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:34,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 10:29:34,346 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:34,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:29:34,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:29:34,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:29:34,347 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 8 states. [2018-11-07 10:29:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:34,585 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-11-07 10:29:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:29:34,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-07 10:29:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:34,588 INFO L225 Difference]: With dead ends: 93 [2018-11-07 10:29:34,588 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 10:29:34,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:29:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 10:29:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2018-11-07 10:29:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 10:29:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-07 10:29:34,597 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2018-11-07 10:29:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:34,597 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-07 10:29:34,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:29:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-07 10:29:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 10:29:34,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:34,599 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:34,599 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:34,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1720590010, now seen corresponding path program 4 times [2018-11-07 10:29:34,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:34,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:34,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:29:34,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:34,723 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:34,723 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:34,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:34,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:34,724 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:34,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:34,739 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:34,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:29:34,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:29:34,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:34,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 10:29:34,954 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:34,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:29:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:29:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:29:34,956 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 9 states. [2018-11-07 10:29:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:35,065 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-07 10:29:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:29:35,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-07 10:29:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:35,068 INFO L225 Difference]: With dead ends: 103 [2018-11-07 10:29:35,068 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 10:29:35,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:29:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 10:29:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-11-07 10:29:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 10:29:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-07 10:29:35,076 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 58 [2018-11-07 10:29:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:35,077 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-07 10:29:35,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:29:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-07 10:29:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 10:29:35,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:35,079 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:35,079 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:35,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1890900745, now seen corresponding path program 5 times [2018-11-07 10:29:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:35,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:35,081 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:29:35,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:35,669 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:35,670 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:35,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:35,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:35,670 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:35,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:35,679 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:35,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:29:35,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:35,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 10:29:35,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 10:29:36,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:36,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-11-07 10:29:36,028 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:36,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:29:36,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:29:36,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:29:36,029 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 11 states. [2018-11-07 10:29:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:36,214 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-11-07 10:29:36,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:29:36,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-07 10:29:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:36,216 INFO L225 Difference]: With dead ends: 115 [2018-11-07 10:29:36,216 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 10:29:36,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:29:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 10:29:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-11-07 10:29:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 10:29:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-11-07 10:29:36,230 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 63 [2018-11-07 10:29:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:36,231 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-11-07 10:29:36,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:29:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-07 10:29:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 10:29:36,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:36,233 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:36,233 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:36,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:36,233 INFO L82 PathProgramCache]: Analyzing trace with hash -451564995, now seen corresponding path program 6 times [2018-11-07 10:29:36,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:36,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:36,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:36,235 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:29:36,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:36,359 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:36,359 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:36,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:36,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:36,359 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:36,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:36,371 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:36,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:36,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:36,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:29:36,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:29:36,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:36,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 10:29:36,630 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:36,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:29:36,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:29:36,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:29:36,631 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 11 states. [2018-11-07 10:29:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:36,772 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-07 10:29:36,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:29:36,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-11-07 10:29:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:36,774 INFO L225 Difference]: With dead ends: 132 [2018-11-07 10:29:36,774 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 10:29:36,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:29:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 10:29:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2018-11-07 10:29:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-07 10:29:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-07 10:29:36,785 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2018-11-07 10:29:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:36,786 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-07 10:29:36,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:29:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-07 10:29:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-07 10:29:36,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:36,787 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:36,787 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:36,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1062232128, now seen corresponding path program 7 times [2018-11-07 10:29:36,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:36,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:36,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:29:37,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:37,071 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:37,071 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:37,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:37,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:37,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:37,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:37,082 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:37,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:29:37,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:29:37,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:37,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 10:29:37,499 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:37,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:29:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:29:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:29:37,501 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 12 states. [2018-11-07 10:29:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:37,711 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-07 10:29:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:29:37,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-11-07 10:29:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:37,713 INFO L225 Difference]: With dead ends: 142 [2018-11-07 10:29:37,713 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 10:29:37,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:29:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 10:29:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2018-11-07 10:29:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 10:29:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-11-07 10:29:37,724 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 85 [2018-11-07 10:29:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:37,724 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-11-07 10:29:37,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:29:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-11-07 10:29:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-07 10:29:37,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:37,726 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:37,726 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:37,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 798073885, now seen corresponding path program 8 times [2018-11-07 10:29:37,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:37,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:37,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:37,728 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:29:37,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:37,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:37,969 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:37,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:37,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:37,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:37,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:37,999 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:38,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:29:38,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:38,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 10:29:38,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 10:29:38,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:38,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-11-07 10:29:38,357 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:38,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:29:38,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:29:38,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:29:38,359 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 14 states. [2018-11-07 10:29:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:38,658 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-11-07 10:29:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:29:38,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-11-07 10:29:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:38,662 INFO L225 Difference]: With dead ends: 154 [2018-11-07 10:29:38,662 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 10:29:38,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:29:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 10:29:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-11-07 10:29:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 10:29:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-11-07 10:29:38,672 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 90 [2018-11-07 10:29:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:38,672 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-11-07 10:29:38,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:29:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-11-07 10:29:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 10:29:38,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:38,677 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:38,677 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:38,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1763815927, now seen corresponding path program 9 times [2018-11-07 10:29:38,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:38,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:38,679 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:29:38,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:38,887 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:38,887 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:38,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:38,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:38,888 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:38,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:38,897 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:38,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:38,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:38,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:29:39,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:29:39,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:39,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 10:29:39,945 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:39,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:29:39,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:29:39,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:29:39,946 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 14 states. [2018-11-07 10:29:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:40,457 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-11-07 10:29:40,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:29:40,457 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-07 10:29:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:40,459 INFO L225 Difference]: With dead ends: 171 [2018-11-07 10:29:40,459 INFO L226 Difference]: Without dead ends: 122 [2018-11-07 10:29:40,460 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:29:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-07 10:29:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2018-11-07 10:29:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-07 10:29:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-11-07 10:29:40,467 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 107 [2018-11-07 10:29:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:40,467 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-11-07 10:29:40,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:29:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-11-07 10:29:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 10:29:40,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:40,469 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:40,469 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:40,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:40,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1559061140, now seen corresponding path program 10 times [2018-11-07 10:29:40,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:40,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:40,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:40,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:40,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:29:40,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:40,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:40,651 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:40,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:40,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:40,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:40,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:40,659 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:40,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:29:40,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:29:41,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:41,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 10:29:41,031 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:41,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:29:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:29:41,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:29:41,033 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 15 states. [2018-11-07 10:29:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:41,312 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2018-11-07 10:29:41,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:29:41,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2018-11-07 10:29:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:41,314 INFO L225 Difference]: With dead ends: 181 [2018-11-07 10:29:41,314 INFO L226 Difference]: Without dead ends: 132 [2018-11-07 10:29:41,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:29:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-07 10:29:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2018-11-07 10:29:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-07 10:29:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-11-07 10:29:41,320 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 112 [2018-11-07 10:29:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:41,320 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-11-07 10:29:41,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:29:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-11-07 10:29:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 10:29:41,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:41,322 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:41,322 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:41,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1893239831, now seen corresponding path program 11 times [2018-11-07 10:29:41,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:41,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:41,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:41,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:41,324 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 10:29:41,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:41,535 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:41,535 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:41,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:41,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:41,535 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:41,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:41,544 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:41,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:29:41,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:41,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 10:29:41,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 10:29:42,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-11-07 10:29:42,030 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:42,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:29:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:29:42,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:29:42,031 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 17 states. [2018-11-07 10:29:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:42,300 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2018-11-07 10:29:42,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:29:42,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 117 [2018-11-07 10:29:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:42,302 INFO L225 Difference]: With dead ends: 193 [2018-11-07 10:29:42,303 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 10:29:42,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:29:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 10:29:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-07 10:29:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 10:29:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-11-07 10:29:42,309 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 117 [2018-11-07 10:29:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:42,309 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-11-07 10:29:42,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:29:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-11-07 10:29:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 10:29:42,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:42,311 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:42,311 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:42,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1235713675, now seen corresponding path program 12 times [2018-11-07 10:29:42,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:42,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:42,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:42,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:42,313 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:29:43,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:43,041 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:43,041 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:43,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:43,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:43,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:43,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:43,050 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:43,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:43,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:43,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:29:43,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:29:43,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:43,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 10:29:43,708 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:43,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:29:43,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:29:43,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:29:43,710 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 17 states. [2018-11-07 10:29:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:43,989 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2018-11-07 10:29:43,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:29:43,990 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 134 [2018-11-07 10:29:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:43,991 INFO L225 Difference]: With dead ends: 210 [2018-11-07 10:29:43,991 INFO L226 Difference]: Without dead ends: 149 [2018-11-07 10:29:43,992 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:29:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-07 10:29:43,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2018-11-07 10:29:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-07 10:29:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-11-07 10:29:43,998 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 134 [2018-11-07 10:29:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:43,998 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-11-07 10:29:43,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:29:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-11-07 10:29:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 10:29:44,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:44,001 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:44,001 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:44,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1270918194, now seen corresponding path program 13 times [2018-11-07 10:29:44,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:44,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:44,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:44,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:44,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:29:44,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:44,988 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:44,988 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:44,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:44,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:44,988 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:44,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:44,998 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:45,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:29:45,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:29:45,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:45,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 10:29:45,492 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:45,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:29:45,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:29:45,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:29:45,494 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 18 states. [2018-11-07 10:29:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:45,721 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2018-11-07 10:29:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:29:45,722 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2018-11-07 10:29:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:45,724 INFO L225 Difference]: With dead ends: 220 [2018-11-07 10:29:45,724 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 10:29:45,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:29:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 10:29:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2018-11-07 10:29:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-07 10:29:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-11-07 10:29:45,730 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 139 [2018-11-07 10:29:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:45,730 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-11-07 10:29:45,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:29:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-11-07 10:29:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 10:29:45,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:45,732 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:45,732 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:45,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:45,733 INFO L82 PathProgramCache]: Analyzing trace with hash 983126123, now seen corresponding path program 14 times [2018-11-07 10:29:45,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:45,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:45,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:45,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:45,734 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 10:29:46,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:46,096 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:46,096 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:46,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:46,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:46,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:46,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:46,105 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:46,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 10:29:46,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:46,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 10:29:46,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 10:29:47,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:47,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-11-07 10:29:47,102 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:47,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:29:47,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:29:47,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:29:47,103 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 20 states. [2018-11-07 10:29:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:47,344 INFO L93 Difference]: Finished difference Result 232 states and 237 transitions. [2018-11-07 10:29:47,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:29:47,346 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 144 [2018-11-07 10:29:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:47,347 INFO L225 Difference]: With dead ends: 232 [2018-11-07 10:29:47,347 INFO L226 Difference]: Without dead ends: 166 [2018-11-07 10:29:47,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:29:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-07 10:29:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-11-07 10:29:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 10:29:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-11-07 10:29:47,353 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 144 [2018-11-07 10:29:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:47,353 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-11-07 10:29:47,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:29:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-11-07 10:29:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 10:29:47,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:47,355 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:47,355 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:47,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash 853731589, now seen corresponding path program 15 times [2018-11-07 10:29:47,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:47,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:47,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:47,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:47,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:29:47,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:47,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:47,688 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:47,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:47,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:47,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:47,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:47,705 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:47,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:47,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:47,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:29:47,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:29:48,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:48,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 10:29:48,835 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:48,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:29:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:29:48,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:29:48,837 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 20 states. [2018-11-07 10:29:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:49,037 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-11-07 10:29:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:29:49,038 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 161 [2018-11-07 10:29:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:49,040 INFO L225 Difference]: With dead ends: 249 [2018-11-07 10:29:49,040 INFO L226 Difference]: Without dead ends: 176 [2018-11-07 10:29:49,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:29:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-07 10:29:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2018-11-07 10:29:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 10:29:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-11-07 10:29:49,045 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 161 [2018-11-07 10:29:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:49,045 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-11-07 10:29:49,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:29:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-11-07 10:29:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 10:29:49,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:49,047 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:49,048 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:49,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash -742202910, now seen corresponding path program 16 times [2018-11-07 10:29:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:49,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:49,049 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:29:49,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:49,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:49,496 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:49,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:49,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:49,497 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:49,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:49,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:49,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:29:49,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:29:50,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:50,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 10:29:50,103 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:50,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:29:50,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:29:50,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:29:50,104 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 21 states. [2018-11-07 10:29:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:50,368 INFO L93 Difference]: Finished difference Result 259 states and 263 transitions. [2018-11-07 10:29:50,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:29:50,368 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 166 [2018-11-07 10:29:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:50,370 INFO L225 Difference]: With dead ends: 259 [2018-11-07 10:29:50,370 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 10:29:50,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 10:29:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 10:29:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-11-07 10:29:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-07 10:29:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-11-07 10:29:50,376 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 166 [2018-11-07 10:29:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:50,376 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-11-07 10:29:50,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:29:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-11-07 10:29:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-07 10:29:50,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:50,378 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:50,378 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:50,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1858278619, now seen corresponding path program 17 times [2018-11-07 10:29:50,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:50,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 10:29:50,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:50,881 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:50,881 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:50,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:50,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:50,882 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:50,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:50,892 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:51,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 10:29:51,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:51,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 10:29:51,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 10:29:51,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:51,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-11-07 10:29:51,709 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:51,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:29:51,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:29:51,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 10:29:51,711 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 23 states. [2018-11-07 10:29:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:52,020 INFO L93 Difference]: Finished difference Result 271 states and 276 transitions. [2018-11-07 10:29:52,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:29:52,021 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 171 [2018-11-07 10:29:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:52,022 INFO L225 Difference]: With dead ends: 271 [2018-11-07 10:29:52,022 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 10:29:52,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:29:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 10:29:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-11-07 10:29:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 10:29:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-11-07 10:29:52,030 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 171 [2018-11-07 10:29:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:52,030 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-11-07 10:29:52,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:29:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-11-07 10:29:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 10:29:52,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:52,031 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:52,032 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:52,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:52,032 INFO L82 PathProgramCache]: Analyzing trace with hash 70537433, now seen corresponding path program 18 times [2018-11-07 10:29:52,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:52,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:52,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:29:52,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:52,893 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:52,893 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:52,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:52,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:52,893 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:52,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:52,902 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:53,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:53,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:53,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:29:53,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:29:53,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:53,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 10:29:53,659 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:53,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:29:53,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:29:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:29:53,660 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 23 states. [2018-11-07 10:29:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:54,006 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2018-11-07 10:29:54,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:29:54,009 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 188 [2018-11-07 10:29:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:54,010 INFO L225 Difference]: With dead ends: 288 [2018-11-07 10:29:54,010 INFO L226 Difference]: Without dead ends: 203 [2018-11-07 10:29:54,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:29:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-07 10:29:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 194. [2018-11-07 10:29:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 10:29:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-11-07 10:29:54,017 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 188 [2018-11-07 10:29:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:54,017 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-11-07 10:29:54,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:29:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-11-07 10:29:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-07 10:29:54,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:54,018 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:54,019 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:54,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash 864859612, now seen corresponding path program 19 times [2018-11-07 10:29:54,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:54,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:54,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:54,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:54,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:29:54,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:54,344 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:54,344 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:54,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:54,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:54,345 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:54,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:54,352 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:54,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:29:54,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:29:55,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:55,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 10:29:55,013 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:55,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:29:55,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:29:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:29:55,015 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 24 states. [2018-11-07 10:29:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:55,878 INFO L93 Difference]: Finished difference Result 298 states and 302 transitions. [2018-11-07 10:29:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:29:55,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 193 [2018-11-07 10:29:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:55,880 INFO L225 Difference]: With dead ends: 298 [2018-11-07 10:29:55,880 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 10:29:55,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:29:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 10:29:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2018-11-07 10:29:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 10:29:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-11-07 10:29:55,886 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 193 [2018-11-07 10:29:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:55,886 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-11-07 10:29:55,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:29:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-11-07 10:29:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 10:29:55,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:55,888 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:55,888 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:55,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash 969538233, now seen corresponding path program 20 times [2018-11-07 10:29:55,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:55,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:55,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 10:29:56,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:56,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:56,449 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:56,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:56,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:56,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:56,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:56,460 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:56,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 10:29:56,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:56,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 10:29:57,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 10:29:58,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:58,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 49 [2018-11-07 10:29:58,349 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:58,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:29:58,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:29:58,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:29:58,351 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 27 states. [2018-11-07 10:29:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:58,662 INFO L93 Difference]: Finished difference Result 310 states and 315 transitions. [2018-11-07 10:29:58,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:29:58,662 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 198 [2018-11-07 10:29:58,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:58,665 INFO L225 Difference]: With dead ends: 310 [2018-11-07 10:29:58,665 INFO L226 Difference]: Without dead ends: 220 [2018-11-07 10:29:58,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 10:29:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-07 10:29:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2018-11-07 10:29:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-07 10:29:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-11-07 10:29:58,672 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 198 [2018-11-07 10:29:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:58,672 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-11-07 10:29:58,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:29:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-11-07 10:29:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 10:29:58,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:58,674 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:58,674 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:58,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1495347693, now seen corresponding path program 21 times [2018-11-07 10:29:58,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:58,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:58,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:58,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:58,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:29:59,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:59,155 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:59,155 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:59,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:59,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:59,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:59,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:59,164 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:59,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:59,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:59,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:29:59,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:30:00,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:00,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 10:30:00,677 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:00,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:30:00,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:30:00,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:30:00,679 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 26 states. [2018-11-07 10:30:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:00,904 INFO L93 Difference]: Finished difference Result 327 states and 330 transitions. [2018-11-07 10:30:00,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:30:00,906 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2018-11-07 10:30:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:00,907 INFO L225 Difference]: With dead ends: 327 [2018-11-07 10:30:00,907 INFO L226 Difference]: Without dead ends: 230 [2018-11-07 10:30:00,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:30:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-07 10:30:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2018-11-07 10:30:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-07 10:30:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-11-07 10:30:00,914 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 215 [2018-11-07 10:30:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:00,914 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-11-07 10:30:00,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:30:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-11-07 10:30:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-07 10:30:00,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:00,916 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:00,916 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:00,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:00,916 INFO L82 PathProgramCache]: Analyzing trace with hash -354263248, now seen corresponding path program 22 times [2018-11-07 10:30:00,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:00,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:00,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:30:01,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:01,589 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:01,589 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:01,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:01,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:01,589 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:01,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:01,599 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:30:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:01,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:30:01,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:30:02,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:02,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 10:30:02,521 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:02,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:30:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:30:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:30:02,523 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 27 states. [2018-11-07 10:30:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:03,132 INFO L93 Difference]: Finished difference Result 337 states and 341 transitions. [2018-11-07 10:30:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:30:03,133 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2018-11-07 10:30:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:03,135 INFO L225 Difference]: With dead ends: 337 [2018-11-07 10:30:03,135 INFO L226 Difference]: Without dead ends: 240 [2018-11-07 10:30:03,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 10:30:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-07 10:30:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 226. [2018-11-07 10:30:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-07 10:30:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-11-07 10:30:03,142 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 220 [2018-11-07 10:30:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:03,142 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-11-07 10:30:03,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:30:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-11-07 10:30:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 10:30:03,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:03,144 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:03,144 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:03,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:03,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1357772851, now seen corresponding path program 23 times [2018-11-07 10:30:03,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:03,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:03,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:03,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 10:30:03,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:03,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:03,867 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:03,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:03,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:03,868 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:03,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:03,876 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:30:05,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 10:30:05,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:05,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 10:30:05,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 10:30:06,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:06,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-11-07 10:30:06,254 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:06,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:30:06,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:30:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 10:30:06,256 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 29 states. [2018-11-07 10:30:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:06,554 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2018-11-07 10:30:06,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:30:06,555 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 225 [2018-11-07 10:30:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:06,557 INFO L225 Difference]: With dead ends: 349 [2018-11-07 10:30:06,557 INFO L226 Difference]: Without dead ends: 247 [2018-11-07 10:30:06,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:30:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-07 10:30:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2018-11-07 10:30:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-07 10:30:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-11-07 10:30:06,564 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 225 [2018-11-07 10:30:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:06,564 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-11-07 10:30:06,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:30:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-11-07 10:30:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-07 10:30:06,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:06,566 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:06,566 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:06,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash -886300377, now seen corresponding path program 24 times [2018-11-07 10:30:06,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:06,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:06,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:06,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:06,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:30:07,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:07,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:07,341 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:07,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:07,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:07,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:07,350 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:07,350 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:08,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:08,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:08,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:30:08,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:30:10,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:10,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 10:30:10,094 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:10,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:30:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:30:10,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:30:10,095 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 29 states. [2018-11-07 10:30:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:10,815 INFO L93 Difference]: Finished difference Result 366 states and 369 transitions. [2018-11-07 10:30:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:30:10,816 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 242 [2018-11-07 10:30:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:10,818 INFO L225 Difference]: With dead ends: 366 [2018-11-07 10:30:10,818 INFO L226 Difference]: Without dead ends: 257 [2018-11-07 10:30:10,820 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 10:30:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-07 10:30:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 248. [2018-11-07 10:30:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-07 10:30:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2018-11-07 10:30:10,825 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 242 [2018-11-07 10:30:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:10,826 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2018-11-07 10:30:10,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:30:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2018-11-07 10:30:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-07 10:30:10,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:10,828 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:10,828 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:10,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash -903625238, now seen corresponding path program 25 times [2018-11-07 10:30:10,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:10,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:10,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:30:11,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:11,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:11,908 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:11,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:11,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:11,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:11,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:11,918 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:30:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:11,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:30:12,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:30:13,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:13,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 10:30:13,470 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:13,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:30:13,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:30:13,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:30:13,473 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 30 states. [2018-11-07 10:30:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:13,762 INFO L93 Difference]: Finished difference Result 376 states and 380 transitions. [2018-11-07 10:30:13,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:30:13,763 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 247 [2018-11-07 10:30:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:13,765 INFO L225 Difference]: With dead ends: 376 [2018-11-07 10:30:13,765 INFO L226 Difference]: Without dead ends: 267 [2018-11-07 10:30:13,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:30:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-07 10:30:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2018-11-07 10:30:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-07 10:30:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-11-07 10:30:13,773 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 247 [2018-11-07 10:30:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:13,773 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-11-07 10:30:13,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:30:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-11-07 10:30:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-07 10:30:13,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:13,775 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:13,775 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:13,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:13,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1257004281, now seen corresponding path program 26 times [2018-11-07 10:30:13,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:13,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:13,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:13,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:13,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 10:30:14,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:14,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:14,588 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:14,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:14,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:14,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:14,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:14,597 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:30:15,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 10:30:15,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:15,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 10:30:15,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 10:30:16,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:16,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-11-07 10:30:16,725 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:16,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:30:16,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:30:16,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 10:30:16,727 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 32 states. [2018-11-07 10:30:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:17,138 INFO L93 Difference]: Finished difference Result 388 states and 393 transitions. [2018-11-07 10:30:17,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:30:17,139 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 252 [2018-11-07 10:30:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:17,141 INFO L225 Difference]: With dead ends: 388 [2018-11-07 10:30:17,141 INFO L226 Difference]: Without dead ends: 274 [2018-11-07 10:30:17,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:30:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-07 10:30:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2018-11-07 10:30:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-07 10:30:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2018-11-07 10:30:17,148 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 252 [2018-11-07 10:30:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:17,148 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2018-11-07 10:30:17,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:30:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2018-11-07 10:30:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 10:30:17,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:17,150 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:17,150 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:17,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1121885919, now seen corresponding path program 27 times [2018-11-07 10:30:17,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:17,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:17,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:17,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:30:17,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:17,715 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:17,715 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:17,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:17,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:17,716 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:17,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:17,741 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:19,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:19,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:19,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:30:19,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:30:20,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:20,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 10:30:20,127 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:20,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:30:20,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:30:20,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:30:20,128 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 32 states. [2018-11-07 10:30:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:20,446 INFO L93 Difference]: Finished difference Result 405 states and 408 transitions. [2018-11-07 10:30:20,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:30:20,448 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 269 [2018-11-07 10:30:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:20,449 INFO L225 Difference]: With dead ends: 405 [2018-11-07 10:30:20,449 INFO L226 Difference]: Without dead ends: 284 [2018-11-07 10:30:20,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:30:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-07 10:30:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 275. [2018-11-07 10:30:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-07 10:30:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-11-07 10:30:20,455 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 269 [2018-11-07 10:30:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:20,455 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-11-07 10:30:20,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:30:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-11-07 10:30:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-07 10:30:20,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:20,457 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:20,457 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:20,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:20,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1941691006, now seen corresponding path program 28 times [2018-11-07 10:30:20,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:20,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:20,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:20,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:20,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:30:20,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:20,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:20,985 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:20,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:20,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:20,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:21,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:21,002 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:30:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:21,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:30:21,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:30:22,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:22,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 10:30:22,308 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:22,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:30:22,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:30:22,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 10:30:22,309 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 33 states. [2018-11-07 10:30:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:22,621 INFO L93 Difference]: Finished difference Result 415 states and 419 transitions. [2018-11-07 10:30:22,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:30:22,621 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 274 [2018-11-07 10:30:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:22,623 INFO L225 Difference]: With dead ends: 415 [2018-11-07 10:30:22,623 INFO L226 Difference]: Without dead ends: 294 [2018-11-07 10:30:22,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 10:30:22,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-07 10:30:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2018-11-07 10:30:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-07 10:30:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-11-07 10:30:22,631 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 274 [2018-11-07 10:30:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:22,631 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-11-07 10:30:22,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 10:30:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-11-07 10:30:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-07 10:30:22,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:22,633 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:22,633 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:22,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:22,634 INFO L82 PathProgramCache]: Analyzing trace with hash -428362943, now seen corresponding path program 29 times [2018-11-07 10:30:22,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:22,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:22,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:22,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 10:30:23,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:23,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:23,740 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:23,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:23,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:23,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:23,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:23,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:30:27,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-07 10:30:27,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:27,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 10:30:27,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 10:30:28,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:28,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-11-07 10:30:28,702 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:28,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:30:28,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:30:28,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 10:30:28,704 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 35 states. [2018-11-07 10:30:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:29,046 INFO L93 Difference]: Finished difference Result 427 states and 432 transitions. [2018-11-07 10:30:29,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:30:29,047 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 279 [2018-11-07 10:30:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:29,049 INFO L225 Difference]: With dead ends: 427 [2018-11-07 10:30:29,049 INFO L226 Difference]: Without dead ends: 301 [2018-11-07 10:30:29,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:30:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-07 10:30:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-11-07 10:30:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-07 10:30:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-11-07 10:30:29,055 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 279 [2018-11-07 10:30:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:29,055 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-11-07 10:30:29,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:30:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-11-07 10:30:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 10:30:29,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:29,057 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:29,057 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:29,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1501491061, now seen corresponding path program 30 times [2018-11-07 10:30:29,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:29,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:29,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:30:29,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:29,643 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:29,644 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:29,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:29,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:29,644 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:29,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:29,652 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:31,968 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:31,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:31,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:30:32,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:30:33,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:33,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 10:30:33,232 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:33,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:30:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:30:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:30:33,234 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 35 states. [2018-11-07 10:30:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:33,727 INFO L93 Difference]: Finished difference Result 444 states and 447 transitions. [2018-11-07 10:30:33,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 10:30:33,728 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 296 [2018-11-07 10:30:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:33,730 INFO L225 Difference]: With dead ends: 444 [2018-11-07 10:30:33,730 INFO L226 Difference]: Without dead ends: 311 [2018-11-07 10:30:33,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 10:30:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-07 10:30:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 302. [2018-11-07 10:30:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-11-07 10:30:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 303 transitions. [2018-11-07 10:30:33,738 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 303 transitions. Word has length 296 [2018-11-07 10:30:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:33,738 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 303 transitions. [2018-11-07 10:30:33,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:30:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 303 transitions. [2018-11-07 10:30:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-11-07 10:30:33,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:33,740 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:33,740 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:33,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1693416456, now seen corresponding path program 31 times [2018-11-07 10:30:33,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:33,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:33,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:33,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:33,742 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:30:34,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:34,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:34,617 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:34,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:34,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:34,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:34,626 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:30:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:34,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:30:34,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:30:36,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:36,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-07 10:30:36,128 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:36,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:30:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:30:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:30:36,129 INFO L87 Difference]: Start difference. First operand 302 states and 303 transitions. Second operand 36 states. [2018-11-07 10:30:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:37,570 INFO L93 Difference]: Finished difference Result 454 states and 458 transitions. [2018-11-07 10:30:37,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:30:37,570 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 301 [2018-11-07 10:30:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:37,571 INFO L225 Difference]: With dead ends: 454 [2018-11-07 10:30:37,572 INFO L226 Difference]: Without dead ends: 321 [2018-11-07 10:30:37,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:30:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-07 10:30:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 307. [2018-11-07 10:30:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-07 10:30:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-11-07 10:30:37,579 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 301 [2018-11-07 10:30:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:37,579 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-11-07 10:30:37,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:30:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-11-07 10:30:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-07 10:30:37,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:37,582 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:37,582 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:37,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:37,582 INFO L82 PathProgramCache]: Analyzing trace with hash 417745237, now seen corresponding path program 32 times [2018-11-07 10:30:37,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:37,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:37,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:37,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:37,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 10:30:39,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:39,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:39,189 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:39,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:39,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:39,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:39,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:39,197 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:30:41,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 10:30:41,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:41,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 10:30:41,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 10:30:42,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:42,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 72 [2018-11-07 10:30:42,939 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:42,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:30:42,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:30:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2288, Invalid=2824, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 10:30:42,941 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 38 states. [2018-11-07 10:30:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:43,391 INFO L93 Difference]: Finished difference Result 466 states and 471 transitions. [2018-11-07 10:30:43,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:30:43,392 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 306 [2018-11-07 10:30:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:43,394 INFO L225 Difference]: With dead ends: 466 [2018-11-07 10:30:43,394 INFO L226 Difference]: Without dead ends: 328 [2018-11-07 10:30:43,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2294, Invalid=2962, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 10:30:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-07 10:30:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2018-11-07 10:30:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-07 10:30:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 325 transitions. [2018-11-07 10:30:43,401 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 325 transitions. Word has length 306 [2018-11-07 10:30:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:43,401 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 325 transitions. [2018-11-07 10:30:43,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:30:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 325 transitions. [2018-11-07 10:30:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-07 10:30:43,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:43,403 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:43,404 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:43,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:43,404 INFO L82 PathProgramCache]: Analyzing trace with hash -449404369, now seen corresponding path program 33 times [2018-11-07 10:30:43,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:43,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:43,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:43,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:43,405 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:30:44,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:44,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:44,111 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:44,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:44,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:44,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:44,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:30:44,119 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:30:51,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:30:51,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:30:51,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:30:52,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:30:53,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:53,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-07 10:30:53,503 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:53,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:30:53,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:30:53,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 10:30:53,504 INFO L87 Difference]: Start difference. First operand 324 states and 325 transitions. Second operand 38 states. [2018-11-07 10:30:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:53,984 INFO L93 Difference]: Finished difference Result 483 states and 486 transitions. [2018-11-07 10:30:53,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 10:30:53,984 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 323 [2018-11-07 10:30:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:53,985 INFO L225 Difference]: With dead ends: 483 [2018-11-07 10:30:53,985 INFO L226 Difference]: Without dead ends: 338 [2018-11-07 10:30:53,986 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 10:30:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-07 10:30:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 329. [2018-11-07 10:30:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-07 10:30:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-11-07 10:30:53,992 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 323 [2018-11-07 10:30:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:53,992 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-11-07 10:30:53,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:30:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-11-07 10:30:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-07 10:30:53,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:53,995 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:53,995 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:53,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:53,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1145000908, now seen corresponding path program 34 times [2018-11-07 10:30:53,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:53,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:53,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:30:53,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:53,996 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:30:54,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:54,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:54,672 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:54,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:54,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:54,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:54,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:54,680 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:30:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:54,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:30:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:30:54,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:30:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:56,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-07 10:30:56,279 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:56,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:30:56,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:30:56,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 10:30:56,280 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 39 states. [2018-11-07 10:30:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:30:56,735 INFO L93 Difference]: Finished difference Result 493 states and 497 transitions. [2018-11-07 10:30:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:30:56,736 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 328 [2018-11-07 10:30:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:30:56,737 INFO L225 Difference]: With dead ends: 493 [2018-11-07 10:30:56,737 INFO L226 Difference]: Without dead ends: 348 [2018-11-07 10:30:56,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 10:30:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-07 10:30:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 334. [2018-11-07 10:30:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-07 10:30:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2018-11-07 10:30:56,744 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 328 [2018-11-07 10:30:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:30:56,744 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2018-11-07 10:30:56,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:30:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2018-11-07 10:30:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-07 10:30:56,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:30:56,747 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:30:56,747 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:30:56,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:30:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 535174223, now seen corresponding path program 35 times [2018-11-07 10:30:56,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:30:56,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:56,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:30:56,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:30:56,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:30:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:30:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 10:30:57,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:57,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:30:57,450 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:30:57,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:30:57,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:30:57,451 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:30:57,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:30:57,459 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:31:03,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-07 10:31:03,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:31:03,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:31:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 10:31:03,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 10:31:05,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:05,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 79 [2018-11-07 10:31:05,733 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:05,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:31:05,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:31:05,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2785, Invalid=3377, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:31:05,734 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 42 states. [2018-11-07 10:31:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:31:06,187 INFO L93 Difference]: Finished difference Result 505 states and 510 transitions. [2018-11-07 10:31:06,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:31:06,188 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 333 [2018-11-07 10:31:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:31:06,190 INFO L225 Difference]: With dead ends: 505 [2018-11-07 10:31:06,190 INFO L226 Difference]: Without dead ends: 355 [2018-11-07 10:31:06,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2791, Invalid=3529, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 10:31:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-07 10:31:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-11-07 10:31:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-07 10:31:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-11-07 10:31:06,197 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 333 [2018-11-07 10:31:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:31:06,198 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-11-07 10:31:06,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:31:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-11-07 10:31:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-07 10:31:06,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:31:06,200 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:31:06,200 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:31:06,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:31:06,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1902330941, now seen corresponding path program 36 times [2018-11-07 10:31:06,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:31:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:06,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:31:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:06,202 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:31:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:31:06,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:06,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:31:06,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:31:06,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:31:06,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:06,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:31:06,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:31:06,946 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:31:19,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:31:19,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:31:19,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:31:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:31:19,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:31:21,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:21,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-07 10:31:21,497 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:21,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 10:31:21,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 10:31:21,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:31:21,498 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 41 states. [2018-11-07 10:31:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:31:21,978 INFO L93 Difference]: Finished difference Result 522 states and 525 transitions. [2018-11-07 10:31:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 10:31:21,978 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 350 [2018-11-07 10:31:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:31:21,979 INFO L225 Difference]: With dead ends: 522 [2018-11-07 10:31:21,979 INFO L226 Difference]: Without dead ends: 365 [2018-11-07 10:31:21,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:31:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-11-07 10:31:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 356. [2018-11-07 10:31:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-07 10:31:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 357 transitions. [2018-11-07 10:31:21,986 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 357 transitions. Word has length 350 [2018-11-07 10:31:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:31:21,986 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 357 transitions. [2018-11-07 10:31:21,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 10:31:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 357 transitions. [2018-11-07 10:31:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-11-07 10:31:21,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:31:21,988 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:31:21,989 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:31:21,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:31:21,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1088352262, now seen corresponding path program 37 times [2018-11-07 10:31:21,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:31:21,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:21,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:31:21,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:21,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:31:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:31:22,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:22,861 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:31:22,861 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:31:22,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:31:22,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:22,861 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:31:22,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:31:22,870 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:31:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:22,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:31:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:31:23,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:31:25,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:25,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-07 10:31:25,490 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:25,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 10:31:25,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 10:31:25,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 10:31:25,491 INFO L87 Difference]: Start difference. First operand 356 states and 357 transitions. Second operand 42 states. [2018-11-07 10:31:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:31:26,006 INFO L93 Difference]: Finished difference Result 532 states and 536 transitions. [2018-11-07 10:31:26,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 10:31:26,006 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 355 [2018-11-07 10:31:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:31:26,008 INFO L225 Difference]: With dead ends: 532 [2018-11-07 10:31:26,008 INFO L226 Difference]: Without dead ends: 375 [2018-11-07 10:31:26,009 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 10:31:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-07 10:31:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 361. [2018-11-07 10:31:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-07 10:31:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-11-07 10:31:26,015 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 355 [2018-11-07 10:31:26,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:31:26,015 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-11-07 10:31:26,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 10:31:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-11-07 10:31:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-11-07 10:31:26,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:31:26,018 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:31:26,018 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:31:26,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:31:26,018 INFO L82 PathProgramCache]: Analyzing trace with hash -701370973, now seen corresponding path program 38 times [2018-11-07 10:31:26,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:31:26,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:26,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:31:26,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:26,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:31:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 10:31:27,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:27,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:31:27,883 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:31:27,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:31:27,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:27,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:31:27,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:31:27,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:31:42,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 10:31:42,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:31:42,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:31:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 10:31:42,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 10:31:44,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:44,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 85 [2018-11-07 10:31:44,296 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:44,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:31:44,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:31:44,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=3890, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 10:31:44,297 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 45 states. [2018-11-07 10:31:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:31:44,851 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2018-11-07 10:31:44,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:31:44,852 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 360 [2018-11-07 10:31:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:31:44,854 INFO L225 Difference]: With dead ends: 544 [2018-11-07 10:31:44,854 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 10:31:44,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3256, Invalid=4054, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 10:31:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 10:31:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2018-11-07 10:31:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-11-07 10:31:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2018-11-07 10:31:44,861 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 360 [2018-11-07 10:31:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:31:44,861 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2018-11-07 10:31:44,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:31:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2018-11-07 10:31:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-07 10:31:44,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:31:44,864 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:31:44,864 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:31:44,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:31:44,865 INFO L82 PathProgramCache]: Analyzing trace with hash -433417923, now seen corresponding path program 39 times [2018-11-07 10:31:44,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:31:44,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:44,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:31:44,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:31:44,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:31:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:31:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:31:45,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:45,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:31:45,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:31:45,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:31:45,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:31:45,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:31:45,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:31:45,881 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:31:57,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:31:57,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:31:57,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:31:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:31:58,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:31:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:31:59,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:31:59,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-07 10:31:59,954 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:31:59,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 10:31:59,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 10:31:59,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 10:31:59,955 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 44 states. [2018-11-07 10:32:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:00,561 INFO L93 Difference]: Finished difference Result 561 states and 564 transitions. [2018-11-07 10:32:00,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 10:32:00,561 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 377 [2018-11-07 10:32:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:00,564 INFO L225 Difference]: With dead ends: 561 [2018-11-07 10:32:00,564 INFO L226 Difference]: Without dead ends: 392 [2018-11-07 10:32:00,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 10:32:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-11-07 10:32:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 383. [2018-11-07 10:32:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-07 10:32:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-11-07 10:32:00,571 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 377 [2018-11-07 10:32:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:00,571 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-11-07 10:32:00,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 10:32:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-11-07 10:32:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-07 10:32:00,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:00,574 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:00,574 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:00,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1457310490, now seen corresponding path program 40 times [2018-11-07 10:32:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:00,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:00,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:32:02,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:02,366 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:02,366 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:02,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:02,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:02,366 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:02,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:02,376 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:02,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:32:02,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:32:04,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:04,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-07 10:32:04,501 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:04,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 10:32:04,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 10:32:04,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 10:32:04,503 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 45 states. [2018-11-07 10:32:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:05,024 INFO L93 Difference]: Finished difference Result 571 states and 575 transitions. [2018-11-07 10:32:05,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:32:05,025 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 382 [2018-11-07 10:32:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:05,026 INFO L225 Difference]: With dead ends: 571 [2018-11-07 10:32:05,027 INFO L226 Difference]: Without dead ends: 402 [2018-11-07 10:32:05,027 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 10:32:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-07 10:32:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 388. [2018-11-07 10:32:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-07 10:32:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 389 transitions. [2018-11-07 10:32:05,033 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 389 transitions. Word has length 382 [2018-11-07 10:32:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:05,033 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 389 transitions. [2018-11-07 10:32:05,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 10:32:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 389 transitions. [2018-11-07 10:32:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-11-07 10:32:05,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:05,036 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:05,036 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:05,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1120219997, now seen corresponding path program 41 times [2018-11-07 10:32:05,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:05,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:05,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:05,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:05,037 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:32:06,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:06,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:06,108 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:06,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:06,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:06,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:06,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:06,117 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:32:23,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-07 10:32:23,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:23,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 10:32:23,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 10:32:25,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:25,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 91 [2018-11-07 10:32:25,584 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:25,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:32:25,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:32:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4439, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 10:32:25,586 INFO L87 Difference]: Start difference. First operand 388 states and 389 transitions. Second operand 48 states. [2018-11-07 10:32:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:26,187 INFO L93 Difference]: Finished difference Result 583 states and 588 transitions. [2018-11-07 10:32:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:32:26,188 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 387 [2018-11-07 10:32:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:26,190 INFO L225 Difference]: With dead ends: 583 [2018-11-07 10:32:26,190 INFO L226 Difference]: Without dead ends: 409 [2018-11-07 10:32:26,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3757, Invalid=4615, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 10:32:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-07 10:32:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 405. [2018-11-07 10:32:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-07 10:32:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-11-07 10:32:26,197 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 387 [2018-11-07 10:32:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:26,197 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-11-07 10:32:26,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:32:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-11-07 10:32:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-07 10:32:26,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:26,200 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:26,200 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:26,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:26,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1904900591, now seen corresponding path program 42 times [2018-11-07 10:32:26,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:26,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:26,202 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 10:32:27,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:27,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:27,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:27,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:27,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:27,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:27,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:32:27,153 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:32:39,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:32:39,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:32:39,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 10:32:39,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 10:32:41,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:41,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-07 10:32:41,682 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:41,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 10:32:41,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 10:32:41,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 10:32:41,683 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 47 states. [2018-11-07 10:32:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:42,348 INFO L93 Difference]: Finished difference Result 600 states and 603 transitions. [2018-11-07 10:32:42,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 10:32:42,348 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 404 [2018-11-07 10:32:42,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:42,351 INFO L225 Difference]: With dead ends: 600 [2018-11-07 10:32:42,351 INFO L226 Difference]: Without dead ends: 419 [2018-11-07 10:32:42,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 10:32:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-07 10:32:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 410. [2018-11-07 10:32:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-11-07 10:32:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2018-11-07 10:32:42,356 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 404 [2018-11-07 10:32:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:42,357 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 411 transitions. [2018-11-07 10:32:42,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 10:32:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 411 transitions. [2018-11-07 10:32:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-07 10:32:42,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:42,360 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:42,360 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:42,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:42,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1382348268, now seen corresponding path program 43 times [2018-11-07 10:32:42,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:42,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:32:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:42,362 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 10:32:43,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:43,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:43,333 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:43,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:43,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:43,333 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:43,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:43,343 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:32:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:43,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:32:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 10:32:43,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:32:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 10:32:45,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:32:45,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-11-07 10:32:45,749 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:32:45,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 10:32:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 10:32:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 10:32:45,750 INFO L87 Difference]: Start difference. First operand 410 states and 411 transitions. Second operand 48 states. [2018-11-07 10:32:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:32:46,424 INFO L93 Difference]: Finished difference Result 610 states and 614 transitions. [2018-11-07 10:32:46,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 10:32:46,424 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 409 [2018-11-07 10:32:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:32:46,426 INFO L225 Difference]: With dead ends: 610 [2018-11-07 10:32:46,426 INFO L226 Difference]: Without dead ends: 429 [2018-11-07 10:32:46,427 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 10:32:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-11-07 10:32:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 415. [2018-11-07 10:32:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-11-07 10:32:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-11-07 10:32:46,433 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 409 [2018-11-07 10:32:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:32:46,434 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-11-07 10:32:46,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 10:32:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-11-07 10:32:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-07 10:32:46,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:32:46,439 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:32:46,439 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:32:46,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:32:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2107207695, now seen corresponding path program 44 times [2018-11-07 10:32:46,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:32:46,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:46,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:32:46,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:32:46,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:32:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:32:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8781 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 10:32:47,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:47,788 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:32:47,789 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:32:47,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:32:47,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:32:47,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:32:47,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:32:47,799 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:33:14,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-11-07 10:33:14,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:14,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8781 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2018-11-07 10:33:15,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8781 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2018-11-07 10:33:17,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:17,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2018-11-07 10:33:17,539 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:17,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 10:33:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 10:33:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 10:33:17,540 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 50 states. [2018-11-07 10:33:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:18,055 INFO L93 Difference]: Finished difference Result 622 states and 627 transitions. [2018-11-07 10:33:18,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 10:33:18,055 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 414 [2018-11-07 10:33:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:18,058 INFO L225 Difference]: With dead ends: 622 [2018-11-07 10:33:18,058 INFO L226 Difference]: Without dead ends: 436 [2018-11-07 10:33:18,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 10:33:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-07 10:33:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2018-11-07 10:33:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-11-07 10:33:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2018-11-07 10:33:18,066 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 414 [2018-11-07 10:33:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:18,066 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2018-11-07 10:33:18,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 10:33:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2018-11-07 10:33:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-11-07 10:33:18,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:18,069 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:18,069 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:18,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1098305973, now seen corresponding path program 45 times [2018-11-07 10:33:18,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:18,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:18,071 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 10:33:19,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:19,297 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:19,297 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:19,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:19,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:19,297 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:19,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:33:19,305 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:33:31,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:33:31,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:33:31,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 10:33:31,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 10:33:34,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:34,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-11-07 10:33:34,256 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:34,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 10:33:34,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 10:33:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 10:33:34,257 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 50 states. [2018-11-07 10:33:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:35,062 INFO L93 Difference]: Finished difference Result 639 states and 642 transitions. [2018-11-07 10:33:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 10:33:35,062 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 431 [2018-11-07 10:33:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:35,064 INFO L225 Difference]: With dead ends: 639 [2018-11-07 10:33:35,064 INFO L226 Difference]: Without dead ends: 446 [2018-11-07 10:33:35,065 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 815 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 10:33:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-07 10:33:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 437. [2018-11-07 10:33:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-11-07 10:33:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-11-07 10:33:35,072 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 431 [2018-11-07 10:33:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:35,072 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-11-07 10:33:35,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 10:33:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-11-07 10:33:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-07 10:33:35,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:35,075 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:35,076 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:35,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash -360431512, now seen corresponding path program 46 times [2018-11-07 10:33:35,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:35,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:33:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:35,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9777 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 10:33:36,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:36,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:36,199 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:36,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:36,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:36,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:36,208 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:33:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:36,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:33:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9777 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 10:33:36,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:33:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9777 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 10:33:39,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:33:39,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-11-07 10:33:39,205 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:33:39,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 10:33:39,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 10:33:39,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 10:33:39,207 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 51 states. [2018-11-07 10:33:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:33:39,970 INFO L93 Difference]: Finished difference Result 649 states and 653 transitions. [2018-11-07 10:33:39,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 10:33:39,972 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 436 [2018-11-07 10:33:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:33:39,974 INFO L225 Difference]: With dead ends: 649 [2018-11-07 10:33:39,974 INFO L226 Difference]: Without dead ends: 456 [2018-11-07 10:33:39,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 10:33:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-11-07 10:33:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 442. [2018-11-07 10:33:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-07 10:33:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 443 transitions. [2018-11-07 10:33:39,980 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 443 transitions. Word has length 436 [2018-11-07 10:33:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:33:39,980 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 443 transitions. [2018-11-07 10:33:39,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 10:33:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 443 transitions. [2018-11-07 10:33:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-11-07 10:33:39,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:33:39,983 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:33:39,983 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:33:39,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:33:39,983 INFO L82 PathProgramCache]: Analyzing trace with hash -333383573, now seen corresponding path program 47 times [2018-11-07 10:33:39,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:33:39,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:39,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:33:39,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:33:39,984 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:33:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:33:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10014 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 10:33:41,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:41,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:33:41,115 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:33:41,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:33:41,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:33:41,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:33:41,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:33:41,126 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown