java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/down_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:38:13,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:38:13,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:38:13,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:38:13,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:38:13,923 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:38:13,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:38:13,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:38:13,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:38:13,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:38:13,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:38:13,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:38:13,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:38:13,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:38:13,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:38:13,934 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:38:13,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:38:13,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:38:13,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:38:13,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:38:13,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:38:13,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:38:13,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:38:13,946 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:38:13,946 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:38:13,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:38:13,950 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:38:13,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:38:13,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:38:13,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:38:13,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:38:13,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:38:13,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:38:13,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:38:13,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:38:13,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:38:13,962 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:38:13,992 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:38:13,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:38:13,993 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:38:13,993 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:38:13,994 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:38:13,994 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:38:13,994 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:38:13,994 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:38:13,994 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:38:13,995 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:38:13,995 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:38:13,995 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:38:13,995 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:38:13,997 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:38:13,997 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:38:13,997 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:38:13,997 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:38:13,997 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:38:13,999 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:38:13,999 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:38:13,999 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:38:14,000 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:38:14,000 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:38:14,000 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:38:14,000 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:38:14,000 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:38:14,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:38:14,001 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:38:14,001 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:38:14,002 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:38:14,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:38:14,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:38:14,002 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:38:14,002 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:38:14,003 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:38:14,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:38:14,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:38:14,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:38:14,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:38:14,092 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:38:14,093 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/down_true-unreach-call_true-termination.i [2018-11-12 20:38:14,167 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb61f236/5e33401da07745139a0f58e42cb7b62d/FLAG7dea73d4c [2018-11-12 20:38:14,658 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:38:14,662 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down_true-unreach-call_true-termination.i [2018-11-12 20:38:14,670 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb61f236/5e33401da07745139a0f58e42cb7b62d/FLAG7dea73d4c [2018-11-12 20:38:14,686 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb61f236/5e33401da07745139a0f58e42cb7b62d [2018-11-12 20:38:14,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:38:14,698 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:38:14,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:38:14,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:38:14,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:38:14,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:38:14" (1/1) ... [2018-11-12 20:38:14,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4990244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:14, skipping insertion in model container [2018-11-12 20:38:14,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:38:14" (1/1) ... [2018-11-12 20:38:14,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:38:14,738 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:38:14,968 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:38:14,973 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:38:14,994 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:38:15,016 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:38:15,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15 WrapperNode [2018-11-12 20:38:15,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:38:15,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:38:15,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:38:15,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:38:15,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... [2018-11-12 20:38:15,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... [2018-11-12 20:38:15,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:38:15,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:38:15,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:38:15,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:38:15,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... [2018-11-12 20:38:15,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... [2018-11-12 20:38:15,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... [2018-11-12 20:38:15,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... [2018-11-12 20:38:15,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... [2018-11-12 20:38:15,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... [2018-11-12 20:38:15,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... [2018-11-12 20:38:15,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:38:15,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:38:15,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:38:15,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:38:15,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:38:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:38:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:38:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:38:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:38:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:38:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:38:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:38:15,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:38:15,608 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:38:15,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:38:15 BoogieIcfgContainer [2018-11-12 20:38:15,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:38:15,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:38:15,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:38:15,616 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:38:15,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:38:14" (1/3) ... [2018-11-12 20:38:15,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2377f817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:38:15, skipping insertion in model container [2018-11-12 20:38:15,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:38:15" (2/3) ... [2018-11-12 20:38:15,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2377f817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:38:15, skipping insertion in model container [2018-11-12 20:38:15,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:38:15" (3/3) ... [2018-11-12 20:38:15,620 INFO L112 eAbstractionObserver]: Analyzing ICFG down_true-unreach-call_true-termination.i [2018-11-12 20:38:15,629 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:38:15,636 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:38:15,652 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:38:15,687 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:38:15,687 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:38:15,687 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:38:15,688 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:38:15,688 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:38:15,688 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:38:15,688 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:38:15,688 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:38:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-12 20:38:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:38:15,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:15,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:15,719 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:15,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:15,725 INFO L82 PathProgramCache]: Analyzing trace with hash 123585964, now seen corresponding path program 1 times [2018-11-12 20:38:15,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:15,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:15,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:15,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:15,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:15,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:38:15,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:38:15,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:38:15,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:38:15,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:38:15,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:38:15,868 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-12 20:38:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:15,892 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-12 20:38:15,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:38:15,894 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-12 20:38:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:15,903 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:38:15,904 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:38:15,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:38:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:38:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-12 20:38:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:38:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-12 20:38:15,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-12 20:38:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:15,951 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-12 20:38:15,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:38:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-12 20:38:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:38:15,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:15,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:15,953 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:15,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash -203615370, now seen corresponding path program 1 times [2018-11-12 20:38:15,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:15,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:15,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:16,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:38:16,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:38:16,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:38:16,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:38:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:38:16,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:38:16,156 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-12 20:38:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:16,269 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-12 20:38:16,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:38:16,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-12 20:38:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:16,271 INFO L225 Difference]: With dead ends: 33 [2018-11-12 20:38:16,271 INFO L226 Difference]: Without dead ends: 20 [2018-11-12 20:38:16,272 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:38:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-12 20:38:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-12 20:38:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-12 20:38:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-12 20:38:16,278 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-12 20:38:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:16,279 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-12 20:38:16,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:38:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-12 20:38:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-12 20:38:16,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:16,280 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:16,280 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:16,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:16,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1025157488, now seen corresponding path program 1 times [2018-11-12 20:38:16,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:16,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:16,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:16,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:16,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:16,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:38:16,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:38:16,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:38:16,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:38:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:38:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:38:16,415 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-12 20:38:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:16,613 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-12 20:38:16,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:38:16,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-12 20:38:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:16,618 INFO L225 Difference]: With dead ends: 34 [2018-11-12 20:38:16,618 INFO L226 Difference]: Without dead ends: 32 [2018-11-12 20:38:16,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:38:16,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-12 20:38:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-12 20:38:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-12 20:38:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-12 20:38:16,635 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2018-11-12 20:38:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:16,637 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-12 20:38:16,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:38:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-12 20:38:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-12 20:38:16,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:16,639 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:16,640 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:16,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1392733261, now seen corresponding path program 1 times [2018-11-12 20:38:16,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:16,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:16,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:16,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:16,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:16,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:16,792 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-12 20:38:16,794 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [22], [28], [30], [36], [39], [41], [44], [46], [47], [48], [49], [51], [52] [2018-11-12 20:38:16,832 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:38:16,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:38:17,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:38:17,179 INFO L272 AbstractInterpreter]: Visited 19 different actions 95 times. Merged at 8 different actions 40 times. Widened at 3 different actions 4 times. Performed 239 root evaluator evaluations with a maximum evaluation depth of 6. Performed 239 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 9 variables. [2018-11-12 20:38:17,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:17,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:38:17,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:17,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:17,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:17,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:17,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:17,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:17,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:17,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-11-12 20:38:17,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:17,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:38:17,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:38:17,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:38:17,458 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-11-12 20:38:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:17,721 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-12 20:38:17,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:38:17,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-12 20:38:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:17,726 INFO L225 Difference]: With dead ends: 46 [2018-11-12 20:38:17,726 INFO L226 Difference]: Without dead ends: 29 [2018-11-12 20:38:17,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:38:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-12 20:38:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-12 20:38:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-12 20:38:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-12 20:38:17,734 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-11-12 20:38:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:17,734 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-12 20:38:17,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:38:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-12 20:38:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-12 20:38:17,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:17,737 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:17,737 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:17,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash -782599891, now seen corresponding path program 2 times [2018-11-12 20:38:17,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:17,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:17,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:17,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:17,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:17,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:17,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:17,897 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:17,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:17,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:17,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:17,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:17,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:17,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:38:17,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:17,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:18,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:38:18,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:18,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2018-11-12 20:38:18,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:18,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:38:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:38:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:38:18,157 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2018-11-12 20:38:18,476 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-12 20:38:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:18,600 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-12 20:38:18,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:38:18,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-12 20:38:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:18,603 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:38:18,603 INFO L226 Difference]: Without dead ends: 37 [2018-11-12 20:38:18,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:38:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-12 20:38:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-12 20:38:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-12 20:38:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-12 20:38:18,616 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2018-11-12 20:38:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:18,617 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-12 20:38:18,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:38:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-12 20:38:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-12 20:38:18,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:18,618 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:18,619 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:18,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:18,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1585665648, now seen corresponding path program 3 times [2018-11-12 20:38:18,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:18,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:18,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:18,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:38:18,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:18,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:18,758 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:18,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:18,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:18,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:18,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:18,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:18,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:18,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:18,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:38:18,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:38:18,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:18,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-11-12 20:38:18,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:18,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:38:18,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:38:18,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:38:18,954 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-11-12 20:38:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:19,159 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-12 20:38:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:38:19,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-12 20:38:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:19,162 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:38:19,165 INFO L226 Difference]: Without dead ends: 39 [2018-11-12 20:38:19,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:38:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-12 20:38:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-12 20:38:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-12 20:38:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-12 20:38:19,174 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-11-12 20:38:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:19,174 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-12 20:38:19,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:38:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-12 20:38:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-12 20:38:19,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:19,176 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:19,176 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:19,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash -75224214, now seen corresponding path program 4 times [2018-11-12 20:38:19,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:19,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:19,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:19,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-12 20:38:19,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:19,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:19,443 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:19,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:19,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:19,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:19,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:19,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:19,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:38:19,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:38:19,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:19,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2018-11-12 20:38:19,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:19,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:38:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:38:19,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:38:19,683 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-11-12 20:38:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:19,872 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-12 20:38:19,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:38:19,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-12 20:38:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:19,874 INFO L225 Difference]: With dead ends: 49 [2018-11-12 20:38:19,874 INFO L226 Difference]: Without dead ends: 47 [2018-11-12 20:38:19,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:38:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-12 20:38:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-12 20:38:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-12 20:38:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-12 20:38:19,883 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2018-11-12 20:38:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:19,883 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-12 20:38:19,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:38:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-12 20:38:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-12 20:38:19,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:19,885 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:19,886 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:19,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash 959019949, now seen corresponding path program 5 times [2018-11-12 20:38:19,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:19,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:19,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:19,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:19,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:38:20,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:20,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:20,000 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:20,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:20,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:20,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:20,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:20,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:20,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:38:20,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:20,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:38:20,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:38:20,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:20,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-11-12 20:38:20,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:20,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:38:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:38:20,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:38:20,195 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 11 states. [2018-11-12 20:38:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:20,367 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-12 20:38:20,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:38:20,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-11-12 20:38:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:20,369 INFO L225 Difference]: With dead ends: 74 [2018-11-12 20:38:20,369 INFO L226 Difference]: Without dead ends: 49 [2018-11-12 20:38:20,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:38:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-12 20:38:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-12 20:38:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-12 20:38:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-12 20:38:20,378 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2018-11-12 20:38:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:20,379 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-12 20:38:20,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:38:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-12 20:38:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-12 20:38:20,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:20,381 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:20,381 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:20,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1636294695, now seen corresponding path program 6 times [2018-11-12 20:38:20,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:20,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:20,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:20,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:20,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 20:38:20,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:20,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:20,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:20,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:20,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:20,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:20,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:20,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:20,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:20,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:20,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:38:20,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:38:20,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:20,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2018-11-12 20:38:20,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:20,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:38:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:38:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:38:20,806 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 12 states. [2018-11-12 20:38:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:20,980 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-12 20:38:20,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:38:20,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-12 20:38:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:20,981 INFO L225 Difference]: With dead ends: 59 [2018-11-12 20:38:20,982 INFO L226 Difference]: Without dead ends: 57 [2018-11-12 20:38:20,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:38:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-12 20:38:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-12 20:38:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-12 20:38:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-12 20:38:20,992 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2018-11-12 20:38:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:20,993 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-12 20:38:20,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:38:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-12 20:38:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-12 20:38:20,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:20,995 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:20,995 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:20,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2134957206, now seen corresponding path program 7 times [2018-11-12 20:38:20,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:20,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:20,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:38:21,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:21,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:21,151 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:21,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:21,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:21,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:21,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:21,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:21,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:38:21,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:38:21,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:21,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-11-12 20:38:21,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:21,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:38:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:38:21,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:38:21,369 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 13 states. [2018-11-12 20:38:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:21,566 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-12 20:38:21,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:38:21,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-12 20:38:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:21,569 INFO L225 Difference]: With dead ends: 88 [2018-11-12 20:38:21,569 INFO L226 Difference]: Without dead ends: 59 [2018-11-12 20:38:21,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:38:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-12 20:38:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-12 20:38:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-12 20:38:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-12 20:38:21,580 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-11-12 20:38:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:21,580 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-12 20:38:21,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:38:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-12 20:38:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-12 20:38:21,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:21,582 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:21,582 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:21,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1771194524, now seen corresponding path program 8 times [2018-11-12 20:38:21,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:21,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:21,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 37 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:38:21,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:21,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:21,735 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:21,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:21,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:21,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:21,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:21,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:21,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:38:21,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:21,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:38:21,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:38:22,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:22,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2018-11-12 20:38:22,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:22,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:38:22,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:38:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:38:22,016 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 13 states. [2018-11-12 20:38:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:22,203 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-11-12 20:38:22,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:38:22,205 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-11-12 20:38:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:22,206 INFO L225 Difference]: With dead ends: 69 [2018-11-12 20:38:22,206 INFO L226 Difference]: Without dead ends: 67 [2018-11-12 20:38:22,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:38:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-12 20:38:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-12 20:38:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-12 20:38:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-11-12 20:38:22,214 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2018-11-12 20:38:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:22,215 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-11-12 20:38:22,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:38:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-12 20:38:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-12 20:38:22,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:22,216 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:22,216 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:22,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash -835949145, now seen corresponding path program 9 times [2018-11-12 20:38:22,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:22,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:22,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:38:22,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:22,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:22,530 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:22,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:22,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:22,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:22,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:22,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:22,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:22,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:22,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:38:22,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:38:23,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:23,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-11-12 20:38:23,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:23,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:38:23,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:38:23,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:38:23,154 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 15 states. [2018-11-12 20:38:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:23,472 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-12 20:38:23,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:38:23,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2018-11-12 20:38:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:23,473 INFO L225 Difference]: With dead ends: 102 [2018-11-12 20:38:23,474 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:38:23,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 117 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:38:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:38:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-12 20:38:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-12 20:38:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-12 20:38:23,494 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2018-11-12 20:38:23,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:23,494 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-12 20:38:23,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:38:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-12 20:38:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-12 20:38:23,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:23,496 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:23,510 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:23,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash -598355679, now seen corresponding path program 10 times [2018-11-12 20:38:23,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:23,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:23,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 68 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 20:38:24,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:24,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:24,236 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:24,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:24,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:24,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:24,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:24,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:24,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:38:24,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:38:24,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:24,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2018-11-12 20:38:24,465 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:24,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:38:24,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:38:24,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:38:24,466 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2018-11-12 20:38:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:24,826 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-12 20:38:24,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:38:24,826 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-11-12 20:38:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:24,828 INFO L225 Difference]: With dead ends: 79 [2018-11-12 20:38:24,828 INFO L226 Difference]: Without dead ends: 77 [2018-11-12 20:38:24,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 125 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:38:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-12 20:38:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-12 20:38:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-12 20:38:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-11-12 20:38:24,836 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 66 [2018-11-12 20:38:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:24,836 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-11-12 20:38:24,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:38:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-11-12 20:38:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-12 20:38:24,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:24,837 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:24,838 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:24,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:24,838 INFO L82 PathProgramCache]: Analyzing trace with hash -781092252, now seen corresponding path program 11 times [2018-11-12 20:38:24,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:24,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:24,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:38:25,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:25,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:25,191 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:25,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:25,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:25,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:25,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:25,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:25,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:38:25,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:25,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:38:25,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:38:25,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:25,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-11-12 20:38:25,572 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:25,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:38:25,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:38:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:38:25,573 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 17 states. [2018-11-12 20:38:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:26,036 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-12 20:38:26,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:38:26,039 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-11-12 20:38:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:26,040 INFO L225 Difference]: With dead ends: 116 [2018-11-12 20:38:26,040 INFO L226 Difference]: Without dead ends: 79 [2018-11-12 20:38:26,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 14 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:38:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-12 20:38:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-12 20:38:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-12 20:38:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-12 20:38:26,049 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-11-12 20:38:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:26,050 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-12 20:38:26,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:38:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-12 20:38:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-12 20:38:26,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:26,051 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:26,052 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:26,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:26,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1719160158, now seen corresponding path program 12 times [2018-11-12 20:38:26,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:26,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:26,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:26,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:26,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 67 proven. 94 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-12 20:38:26,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:26,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:26,197 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:26,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:26,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:26,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:26,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:26,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:26,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:26,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:26,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:38:26,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:38:26,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:26,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2018-11-12 20:38:26,567 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:26,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:38:26,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:38:26,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:38:26,569 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 15 states. [2018-11-12 20:38:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:26,708 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-11-12 20:38:26,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:38:26,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-12 20:38:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:26,710 INFO L225 Difference]: With dead ends: 89 [2018-11-12 20:38:26,710 INFO L226 Difference]: Without dead ends: 87 [2018-11-12 20:38:26,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 144 SyntacticMatches, 15 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:38:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-12 20:38:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-12 20:38:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-12 20:38:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-11-12 20:38:26,719 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 76 [2018-11-12 20:38:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:26,719 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-11-12 20:38:26,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:38:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-11-12 20:38:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-12 20:38:26,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:26,721 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:26,721 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:26,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1817810527, now seen corresponding path program 13 times [2018-11-12 20:38:26,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:26,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:26,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:26,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:26,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:38:26,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:26,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:26,887 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:26,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:26,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:26,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:26,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:26,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:26,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:38:26,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:38:27,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:27,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-11-12 20:38:27,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:27,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:38:27,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:38:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:38:27,110 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 19 states. [2018-11-12 20:38:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:27,636 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-12 20:38:27,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:38:27,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-12 20:38:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:27,641 INFO L225 Difference]: With dead ends: 130 [2018-11-12 20:38:27,641 INFO L226 Difference]: Without dead ends: 89 [2018-11-12 20:38:27,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 153 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:38:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-12 20:38:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-12 20:38:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-12 20:38:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-11-12 20:38:27,659 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2018-11-12 20:38:27,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:27,659 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-11-12 20:38:27,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:38:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-11-12 20:38:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-12 20:38:27,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:27,661 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:27,661 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:27,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash 455429147, now seen corresponding path program 14 times [2018-11-12 20:38:27,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:27,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:27,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:27,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 85 proven. 124 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-12 20:38:27,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:27,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:27,875 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:27,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:27,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:27,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:27,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:27,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:27,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:38:27,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:27,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:38:27,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:38:28,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:28,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2018-11-12 20:38:28,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:28,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:38:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:38:28,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:38:28,136 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 16 states. [2018-11-12 20:38:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:28,332 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-11-12 20:38:28,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:38:28,333 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-11-12 20:38:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:28,334 INFO L225 Difference]: With dead ends: 99 [2018-11-12 20:38:28,334 INFO L226 Difference]: Without dead ends: 97 [2018-11-12 20:38:28,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 163 SyntacticMatches, 17 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:38:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-12 20:38:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-12 20:38:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-12 20:38:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-11-12 20:38:28,341 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2018-11-12 20:38:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:28,342 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-11-12 20:38:28,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:38:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-11-12 20:38:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-12 20:38:28,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:28,343 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:28,344 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:28,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:28,346 INFO L82 PathProgramCache]: Analyzing trace with hash 955997022, now seen corresponding path program 15 times [2018-11-12 20:38:28,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:28,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:28,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:28,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:38:28,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:28,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:28,634 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:28,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:28,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:28,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:28,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:28,644 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:28,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:28,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:28,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:38:28,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:38:28,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:28,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-11-12 20:38:28,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:28,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:38:28,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:38:28,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:38:28,891 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 21 states. [2018-11-12 20:38:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:29,199 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-12 20:38:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:38:29,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 94 [2018-11-12 20:38:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:29,201 INFO L225 Difference]: With dead ends: 144 [2018-11-12 20:38:29,201 INFO L226 Difference]: Without dead ends: 99 [2018-11-12 20:38:29,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 171 SyntacticMatches, 18 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:38:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-12 20:38:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-12 20:38:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-12 20:38:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-11-12 20:38:29,209 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2018-11-12 20:38:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:29,210 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-11-12 20:38:29,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:38:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-11-12 20:38:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-12 20:38:29,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:29,211 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:29,211 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:29,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash -708514472, now seen corresponding path program 16 times [2018-11-12 20:38:29,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:29,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:29,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:29,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:29,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 105 proven. 158 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-12 20:38:29,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:29,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:29,416 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:29,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:29,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:29,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:29,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:29,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:29,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:38:29,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:38:29,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:29,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2018-11-12 20:38:29,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:29,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:38:29,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:38:29,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:38:29,654 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 17 states. [2018-11-12 20:38:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:29,868 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-11-12 20:38:29,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:38:29,869 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-12 20:38:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:29,871 INFO L225 Difference]: With dead ends: 109 [2018-11-12 20:38:29,871 INFO L226 Difference]: Without dead ends: 107 [2018-11-12 20:38:29,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 182 SyntacticMatches, 19 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:38:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-12 20:38:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-12 20:38:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-12 20:38:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-11-12 20:38:29,878 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2018-11-12 20:38:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:29,879 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-11-12 20:38:29,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:38:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-11-12 20:38:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-12 20:38:29,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:29,880 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:29,880 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:29,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:29,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1119383451, now seen corresponding path program 17 times [2018-11-12 20:38:29,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:29,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:29,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:29,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:29,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:38:31,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:31,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:31,456 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:31,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:31,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:31,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:31,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:31,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:38:31,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:31,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:38:31,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:38:31,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:31,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-11-12 20:38:31,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:31,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:38:31,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:38:31,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:38:31,760 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 23 states. [2018-11-12 20:38:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:32,181 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-11-12 20:38:32,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:38:32,182 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 104 [2018-11-12 20:38:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:32,183 INFO L225 Difference]: With dead ends: 158 [2018-11-12 20:38:32,183 INFO L226 Difference]: Without dead ends: 109 [2018-11-12 20:38:32,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 189 SyntacticMatches, 20 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:38:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-12 20:38:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-11-12 20:38:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-12 20:38:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-11-12 20:38:32,191 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2018-11-12 20:38:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:32,191 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-11-12 20:38:32,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:38:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-11-12 20:38:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-12 20:38:32,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:32,193 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:32,193 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:32,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash 685199637, now seen corresponding path program 18 times [2018-11-12 20:38:32,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:32,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:32,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 127 proven. 196 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-12 20:38:32,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:32,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:32,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:32,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:32,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:32,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:32,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:32,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:32,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:32,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:32,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:38:32,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:38:32,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:32,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2018-11-12 20:38:32,828 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:32,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:38:32,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:38:32,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:38:32,829 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 18 states. [2018-11-12 20:38:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:33,035 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-11-12 20:38:33,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:38:33,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 106 [2018-11-12 20:38:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:33,037 INFO L225 Difference]: With dead ends: 119 [2018-11-12 20:38:33,037 INFO L226 Difference]: Without dead ends: 117 [2018-11-12 20:38:33,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 21 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:38:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-12 20:38:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-12 20:38:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-12 20:38:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-11-12 20:38:33,045 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2018-11-12 20:38:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:33,045 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-11-12 20:38:33,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:38:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-11-12 20:38:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-12 20:38:33,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:33,047 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:33,047 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:33,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1363002968, now seen corresponding path program 19 times [2018-11-12 20:38:33,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:33,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:33,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:33,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:33,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:38:33,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:33,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:33,349 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:33,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:33,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:33,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:33,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:33,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:33,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:38:33,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:38:33,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:33,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-11-12 20:38:33,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:33,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:38:33,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:38:33,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:38:33,627 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 25 states. [2018-11-12 20:38:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:34,318 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-11-12 20:38:34,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:38:34,319 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 114 [2018-11-12 20:38:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:34,321 INFO L225 Difference]: With dead ends: 172 [2018-11-12 20:38:34,321 INFO L226 Difference]: Without dead ends: 119 [2018-11-12 20:38:34,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:38:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-12 20:38:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-11-12 20:38:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-12 20:38:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-11-12 20:38:34,329 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-11-12 20:38:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:34,329 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-11-12 20:38:34,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:38:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-11-12 20:38:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-12 20:38:34,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:34,330 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:34,331 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:34,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1611360430, now seen corresponding path program 20 times [2018-11-12 20:38:34,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:34,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:34,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 151 proven. 238 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-12 20:38:34,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:34,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:34,618 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:34,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:34,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:34,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:34,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:34,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:38:34,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:34,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:38:34,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:38:34,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:34,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2018-11-12 20:38:34,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:34,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:38:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:38:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:38:34,973 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 19 states. [2018-11-12 20:38:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:35,156 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-11-12 20:38:35,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:38:35,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 116 [2018-11-12 20:38:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:35,158 INFO L225 Difference]: With dead ends: 129 [2018-11-12 20:38:35,158 INFO L226 Difference]: Without dead ends: 127 [2018-11-12 20:38:35,159 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 220 SyntacticMatches, 23 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:38:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-12 20:38:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-12 20:38:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-12 20:38:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-11-12 20:38:35,167 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2018-11-12 20:38:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:35,168 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-11-12 20:38:35,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:38:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-11-12 20:38:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-12 20:38:35,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:35,170 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:35,170 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:35,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1711505301, now seen corresponding path program 21 times [2018-11-12 20:38:35,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:35,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:35,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:35,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:35,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:38:35,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:35,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:35,673 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:35,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:35,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:35,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:35,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:35,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:35,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:35,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:35,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:38:35,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:38:36,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:36,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-11-12 20:38:36,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:36,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:38:36,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:38:36,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:38:36,160 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 27 states. [2018-11-12 20:38:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:36,662 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2018-11-12 20:38:36,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:38:36,670 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 124 [2018-11-12 20:38:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:36,671 INFO L225 Difference]: With dead ends: 186 [2018-11-12 20:38:36,671 INFO L226 Difference]: Without dead ends: 129 [2018-11-12 20:38:36,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 225 SyntacticMatches, 24 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=1169, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:38:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-12 20:38:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-12 20:38:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-12 20:38:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-11-12 20:38:36,680 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2018-11-12 20:38:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:36,680 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-11-12 20:38:36,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:38:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-11-12 20:38:36,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-12 20:38:36,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:36,681 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:36,682 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:36,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:36,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2117279729, now seen corresponding path program 22 times [2018-11-12 20:38:36,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:36,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:36,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:36,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:36,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 177 proven. 284 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-12 20:38:37,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:37,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:37,863 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:37,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:37,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:37,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:37,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:37,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:37,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 178 proven. 253 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:38:38,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 178 proven. 253 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:38:38,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:38,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 20 [2018-11-12 20:38:38,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:38,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:38:38,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:38:38,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:38:38,571 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 20 states. [2018-11-12 20:38:39,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:39,618 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-11-12 20:38:39,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:38:39,618 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 126 [2018-11-12 20:38:39,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:39,620 INFO L225 Difference]: With dead ends: 139 [2018-11-12 20:38:39,621 INFO L226 Difference]: Without dead ends: 137 [2018-11-12 20:38:39,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 239 SyntacticMatches, 25 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:38:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-12 20:38:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-11-12 20:38:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-12 20:38:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-11-12 20:38:39,628 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2018-11-12 20:38:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:39,628 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-11-12 20:38:39,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:38:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-11-12 20:38:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-12 20:38:39,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:39,630 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:39,630 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:39,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1516651694, now seen corresponding path program 23 times [2018-11-12 20:38:39,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:39,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:39,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:39,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:39,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 324 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:38:39,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:39,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:39,955 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:39,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:39,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:39,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:39,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:39,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:40,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-12 20:38:40,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:40,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 324 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:38:40,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 324 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:38:40,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:40,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-11-12 20:38:40,654 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:40,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:38:40,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:38:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:38:40,656 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 29 states. [2018-11-12 20:38:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:41,248 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2018-11-12 20:38:41,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:38:41,255 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 134 [2018-11-12 20:38:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:41,256 INFO L225 Difference]: With dead ends: 200 [2018-11-12 20:38:41,256 INFO L226 Difference]: Without dead ends: 139 [2018-11-12 20:38:41,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 243 SyntacticMatches, 26 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:38:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-12 20:38:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-11-12 20:38:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-12 20:38:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-11-12 20:38:41,265 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-11-12 20:38:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:41,265 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-11-12 20:38:41,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:38:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-11-12 20:38:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-12 20:38:41,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:41,267 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:41,267 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:41,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:41,267 INFO L82 PathProgramCache]: Analyzing trace with hash 304630604, now seen corresponding path program 24 times [2018-11-12 20:38:41,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:41,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:41,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:41,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:41,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 205 proven. 334 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-12 20:38:41,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:41,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:41,706 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:41,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:41,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:41,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:41,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:41,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:41,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:41,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:41,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 206 proven. 300 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:38:41,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 206 proven. 300 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:38:42,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:42,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 21 [2018-11-12 20:38:42,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:42,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:38:42,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:38:42,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:38:42,074 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 21 states. [2018-11-12 20:38:42,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:42,315 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-11-12 20:38:42,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:38:42,315 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 136 [2018-11-12 20:38:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:42,317 INFO L225 Difference]: With dead ends: 149 [2018-11-12 20:38:42,317 INFO L226 Difference]: Without dead ends: 147 [2018-11-12 20:38:42,318 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 258 SyntacticMatches, 27 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:38:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-12 20:38:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-11-12 20:38:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-12 20:38:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-11-12 20:38:42,328 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2018-11-12 20:38:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:42,328 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-11-12 20:38:42,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:38:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-11-12 20:38:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-12 20:38:42,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:42,329 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:42,330 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:42,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:42,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1717003889, now seen corresponding path program 25 times [2018-11-12 20:38:42,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:42,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:42,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:42,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:42,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:38:43,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:43,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:43,107 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:43,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:43,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:43,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:43,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:43,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:43,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:38:43,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:38:43,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:43,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-11-12 20:38:43,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:43,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:38:43,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:38:43,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:38:43,493 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 31 states. [2018-11-12 20:38:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:45,011 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-11-12 20:38:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:38:45,012 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 144 [2018-11-12 20:38:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:45,013 INFO L225 Difference]: With dead ends: 214 [2018-11-12 20:38:45,013 INFO L226 Difference]: Without dead ends: 149 [2018-11-12 20:38:45,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 261 SyntacticMatches, 28 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=511, Invalid=1559, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:38:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-12 20:38:45,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-12 20:38:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-12 20:38:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-11-12 20:38:45,022 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2018-11-12 20:38:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:45,022 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-11-12 20:38:45,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:38:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-11-12 20:38:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-12 20:38:45,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:45,023 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:45,024 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:45,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:45,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1407645961, now seen corresponding path program 26 times [2018-11-12 20:38:45,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:45,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:45,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:45,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:45,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 235 proven. 388 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-12 20:38:45,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:45,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:45,690 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:45,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:45,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:45,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:45,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:45,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:45,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-12 20:38:45,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:45,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 236 proven. 351 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:38:45,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 236 proven. 351 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:38:46,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:46,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 22 [2018-11-12 20:38:46,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:46,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:38:46,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:38:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:38:46,083 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 22 states. [2018-11-12 20:38:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:46,290 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-11-12 20:38:46,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:38:46,290 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 146 [2018-11-12 20:38:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:46,292 INFO L225 Difference]: With dead ends: 159 [2018-11-12 20:38:46,292 INFO L226 Difference]: Without dead ends: 157 [2018-11-12 20:38:46,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 277 SyntacticMatches, 29 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:38:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-12 20:38:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-11-12 20:38:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-12 20:38:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-11-12 20:38:46,301 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 146 [2018-11-12 20:38:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:46,301 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-11-12 20:38:46,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:38:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-11-12 20:38:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-12 20:38:46,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:46,303 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:46,303 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:46,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash -219137460, now seen corresponding path program 27 times [2018-11-12 20:38:46,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:46,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:46,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 434 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:38:46,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:46,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:46,698 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:46,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:46,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:46,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:46,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:46,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:46,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:46,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:46,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 434 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:38:46,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 434 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:38:47,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:47,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-11-12 20:38:47,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:47,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:38:47,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:38:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:38:47,230 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 33 states. [2018-11-12 20:38:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:48,270 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2018-11-12 20:38:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:38:48,277 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 154 [2018-11-12 20:38:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:48,278 INFO L225 Difference]: With dead ends: 228 [2018-11-12 20:38:48,279 INFO L226 Difference]: Without dead ends: 159 [2018-11-12 20:38:48,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 279 SyntacticMatches, 30 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=577, Invalid=1775, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:38:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-12 20:38:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-12 20:38:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-12 20:38:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-11-12 20:38:48,291 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-11-12 20:38:48,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:48,292 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-11-12 20:38:48,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:38:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-11-12 20:38:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-12 20:38:48,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:48,294 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:48,294 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:48,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:48,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1258359110, now seen corresponding path program 28 times [2018-11-12 20:38:48,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:48,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:48,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:48,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:48,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 267 proven. 446 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-12 20:38:48,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:48,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:48,644 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:48,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:48,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:48,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:48,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:48,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:48,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 268 proven. 406 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:38:48,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 268 proven. 406 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:38:49,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:49,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 23 [2018-11-12 20:38:49,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:49,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:38:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:38:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:38:49,193 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 23 states. [2018-11-12 20:38:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:49,402 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-11-12 20:38:49,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:38:49,403 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 156 [2018-11-12 20:38:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:49,405 INFO L225 Difference]: With dead ends: 169 [2018-11-12 20:38:49,405 INFO L226 Difference]: Without dead ends: 167 [2018-11-12 20:38:49,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 296 SyntacticMatches, 31 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:38:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-12 20:38:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-11-12 20:38:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:38:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-11-12 20:38:49,413 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 156 [2018-11-12 20:38:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:49,413 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-11-12 20:38:49,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:38:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-11-12 20:38:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-12 20:38:49,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:49,414 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:49,414 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:49,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash -884425335, now seen corresponding path program 29 times [2018-11-12 20:38:49,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:49,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:49,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:49,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:49,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 495 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:38:49,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:49,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:49,863 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:49,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:49,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:49,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:49,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:49,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-12 20:38:49,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:49,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 495 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:38:49,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 495 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:38:50,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:50,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-11-12 20:38:50,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:50,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:38:50,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:38:50,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:38:50,363 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 35 states. [2018-11-12 20:38:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:51,219 INFO L93 Difference]: Finished difference Result 242 states and 259 transitions. [2018-11-12 20:38:51,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:38:51,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 164 [2018-11-12 20:38:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:51,227 INFO L225 Difference]: With dead ends: 242 [2018-11-12 20:38:51,228 INFO L226 Difference]: Without dead ends: 169 [2018-11-12 20:38:51,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 297 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=647, Invalid=2005, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:38:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-12 20:38:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-11-12 20:38:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-12 20:38:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-11-12 20:38:51,238 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2018-11-12 20:38:51,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:51,239 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-11-12 20:38:51,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:38:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-11-12 20:38:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-12 20:38:51,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:51,240 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:51,241 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:51,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1098474493, now seen corresponding path program 30 times [2018-11-12 20:38:51,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:51,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:51,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:51,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:51,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 301 proven. 508 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-12 20:38:52,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:52,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:52,402 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:52,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:52,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:52,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:52,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:52,411 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:52,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:52,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:52,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 302 proven. 465 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:38:53,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 302 proven. 465 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:38:53,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:53,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 24 [2018-11-12 20:38:53,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:53,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:38:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:38:53,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:38:53,988 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 24 states. [2018-11-12 20:38:54,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:54,344 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-11-12 20:38:54,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:38:54,344 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 166 [2018-11-12 20:38:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:54,346 INFO L225 Difference]: With dead ends: 179 [2018-11-12 20:38:54,347 INFO L226 Difference]: Without dead ends: 177 [2018-11-12 20:38:54,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 315 SyntacticMatches, 33 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:38:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-12 20:38:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-12 20:38:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-12 20:38:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-11-12 20:38:54,356 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 166 [2018-11-12 20:38:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:54,357 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-11-12 20:38:54,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:38:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-11-12 20:38:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-12 20:38:54,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:54,358 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:54,358 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:54,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:54,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1738687302, now seen corresponding path program 31 times [2018-11-12 20:38:54,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:54,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:54,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:54,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:54,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 560 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:38:55,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:55,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:55,317 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:55,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:55,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:55,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:55,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:55,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:55,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 560 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:38:55,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 560 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:38:55,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:55,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-11-12 20:38:55,900 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:55,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:38:55,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:38:55,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:38:55,902 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 37 states. [2018-11-12 20:38:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:56,567 INFO L93 Difference]: Finished difference Result 256 states and 274 transitions. [2018-11-12 20:38:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:38:56,568 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 174 [2018-11-12 20:38:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:56,569 INFO L225 Difference]: With dead ends: 256 [2018-11-12 20:38:56,569 INFO L226 Difference]: Without dead ends: 179 [2018-11-12 20:38:56,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 315 SyntacticMatches, 34 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=721, Invalid=2249, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:38:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-12 20:38:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-11-12 20:38:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-12 20:38:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-11-12 20:38:56,579 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2018-11-12 20:38:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:56,580 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-11-12 20:38:56,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:38:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-11-12 20:38:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-12 20:38:56,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:56,581 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:56,581 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:56,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:56,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2057294144, now seen corresponding path program 32 times [2018-11-12 20:38:56,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:56,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:56,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:56,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:56,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 337 proven. 574 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-12 20:38:57,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:57,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:57,046 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:57,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:57,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:57,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:57,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:57,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:57,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-12 20:38:57,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:57,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 338 proven. 528 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:38:57,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 338 proven. 528 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:38:57,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:57,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 25 [2018-11-12 20:38:57,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:57,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:38:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:38:57,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:38:57,566 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 25 states. [2018-11-12 20:38:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:58,178 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-11-12 20:38:58,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:38:58,178 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 176 [2018-11-12 20:38:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:58,179 INFO L225 Difference]: With dead ends: 189 [2018-11-12 20:38:58,180 INFO L226 Difference]: Without dead ends: 187 [2018-11-12 20:38:58,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 334 SyntacticMatches, 35 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:38:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-12 20:38:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-11-12 20:38:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-12 20:38:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-11-12 20:38:58,189 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 176 [2018-11-12 20:38:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:58,189 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-11-12 20:38:58,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:38:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-11-12 20:38:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-12 20:38:58,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:58,191 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:58,191 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:58,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:58,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2047142787, now seen corresponding path program 33 times [2018-11-12 20:38:58,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:58,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:58,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:58,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:58,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 629 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:38:58,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:58,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:58,780 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:58,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:58,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:58,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:38:58,789 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:38:58,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:38:58,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:58,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 629 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:38:58,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 629 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:38:59,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:59,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-11-12 20:38:59,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:59,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:38:59,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:38:59,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:38:59,765 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 39 states. [2018-11-12 20:39:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:00,821 INFO L93 Difference]: Finished difference Result 270 states and 289 transitions. [2018-11-12 20:39:00,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:39:00,821 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 184 [2018-11-12 20:39:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:00,822 INFO L225 Difference]: With dead ends: 270 [2018-11-12 20:39:00,823 INFO L226 Difference]: Without dead ends: 189 [2018-11-12 20:39:00,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 333 SyntacticMatches, 36 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=799, Invalid=2507, Unknown=0, NotChecked=0, Total=3306 [2018-11-12 20:39:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-12 20:39:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-11-12 20:39:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-12 20:39:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-11-12 20:39:00,834 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 184 [2018-11-12 20:39:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:00,834 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-11-12 20:39:00,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:39:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-11-12 20:39:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-12 20:39:00,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:00,836 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:00,836 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:00,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:00,836 INFO L82 PathProgramCache]: Analyzing trace with hash 311216381, now seen corresponding path program 34 times [2018-11-12 20:39:00,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:00,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:00,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:00,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:00,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 375 proven. 644 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-12 20:39:01,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:01,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:01,485 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:01,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:01,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:01,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:01,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:01,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:39:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:01,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 376 proven. 595 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:39:01,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 376 proven. 595 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:39:02,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:02,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 26 [2018-11-12 20:39:02,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:02,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:39:02,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:39:02,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=428, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:39:02,155 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 26 states. [2018-11-12 20:39:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:02,415 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-11-12 20:39:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:39:02,416 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 186 [2018-11-12 20:39:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:02,418 INFO L225 Difference]: With dead ends: 199 [2018-11-12 20:39:02,418 INFO L226 Difference]: Without dead ends: 197 [2018-11-12 20:39:02,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 353 SyntacticMatches, 37 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:39:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-12 20:39:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-11-12 20:39:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-12 20:39:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-11-12 20:39:02,426 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 186 [2018-11-12 20:39:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:02,426 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-11-12 20:39:02,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:39:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-11-12 20:39:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-12 20:39:02,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:02,428 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:02,428 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:02,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash -477047232, now seen corresponding path program 35 times [2018-11-12 20:39:02,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:02,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:02,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:02,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:02,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 702 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:39:03,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:03,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:03,774 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:03,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:03,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:03,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:03,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:39:03,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:39:03,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-12 20:39:03,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:03,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 702 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:39:03,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 702 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:39:04,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:04,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-11-12 20:39:04,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:04,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:39:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:39:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:39:04,397 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 41 states. [2018-11-12 20:39:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:05,447 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2018-11-12 20:39:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:39:05,448 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 194 [2018-11-12 20:39:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:05,449 INFO L225 Difference]: With dead ends: 284 [2018-11-12 20:39:05,449 INFO L226 Difference]: Without dead ends: 199 [2018-11-12 20:39:05,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 351 SyntacticMatches, 38 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=881, Invalid=2779, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:39:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-12 20:39:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-12 20:39:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-12 20:39:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-11-12 20:39:05,461 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 194 [2018-11-12 20:39:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:05,461 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-11-12 20:39:05,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:39:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-11-12 20:39:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-12 20:39:05,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:05,463 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:05,463 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:05,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash 581280570, now seen corresponding path program 36 times [2018-11-12 20:39:05,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:05,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:05,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 415 proven. 718 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-12 20:39:06,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:06,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:06,195 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:06,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:06,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:06,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:06,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:39:06,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:39:06,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:39:06,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:06,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 416 proven. 666 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:39:06,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 416 proven. 666 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:39:06,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:06,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 27 [2018-11-12 20:39:06,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:06,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:39:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:39:06,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:39:06,708 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 27 states. [2018-11-12 20:39:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:06,930 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-11-12 20:39:06,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:39:06,931 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 196 [2018-11-12 20:39:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:06,932 INFO L225 Difference]: With dead ends: 209 [2018-11-12 20:39:06,933 INFO L226 Difference]: Without dead ends: 207 [2018-11-12 20:39:06,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 372 SyntacticMatches, 39 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:39:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-12 20:39:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-11-12 20:39:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-12 20:39:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-11-12 20:39:06,942 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 196 [2018-11-12 20:39:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:06,943 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-11-12 20:39:06,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:39:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-11-12 20:39:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-12 20:39:06,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:06,944 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:06,945 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:06,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:06,945 INFO L82 PathProgramCache]: Analyzing trace with hash -159505539, now seen corresponding path program 37 times [2018-11-12 20:39:06,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:06,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:06,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:06,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:06,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 779 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:39:07,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:07,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:07,655 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:07,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:07,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:07,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:07,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:07,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:39:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:07,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 779 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:39:07,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 779 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:39:08,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:08,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-11-12 20:39:08,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:08,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:39:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:39:08,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:39:08,565 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 43 states. [2018-11-12 20:39:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:09,776 INFO L93 Difference]: Finished difference Result 298 states and 319 transitions. [2018-11-12 20:39:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:39:09,776 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 204 [2018-11-12 20:39:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:09,777 INFO L225 Difference]: With dead ends: 298 [2018-11-12 20:39:09,778 INFO L226 Difference]: Without dead ends: 209 [2018-11-12 20:39:09,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 369 SyntacticMatches, 40 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2018-11-12 20:39:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-12 20:39:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-11-12 20:39:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-12 20:39:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-11-12 20:39:09,789 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2018-11-12 20:39:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:09,790 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-11-12 20:39:09,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:39:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-11-12 20:39:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-12 20:39:09,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:09,791 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:09,791 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:09,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash 307920887, now seen corresponding path program 38 times [2018-11-12 20:39:09,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:09,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:09,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:09,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:09,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 457 proven. 796 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-12 20:39:10,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:10,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:10,768 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:10,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:10,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:10,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:10,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:39:10,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:39:10,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-12 20:39:10,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:10,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 458 proven. 741 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:39:11,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 458 proven. 741 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:39:11,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:11,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 28 [2018-11-12 20:39:11,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:11,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:39:11,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:39:11,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=491, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:39:11,690 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 28 states. [2018-11-12 20:39:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:11,955 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-11-12 20:39:11,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:39:11,955 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 206 [2018-11-12 20:39:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:11,957 INFO L225 Difference]: With dead ends: 219 [2018-11-12 20:39:11,957 INFO L226 Difference]: Without dead ends: 217 [2018-11-12 20:39:11,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 391 SyntacticMatches, 41 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=278, Invalid=592, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:39:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-12 20:39:11,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-11-12 20:39:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-12 20:39:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-11-12 20:39:11,976 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 206 [2018-11-12 20:39:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:11,976 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-11-12 20:39:11,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:39:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-11-12 20:39:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-12 20:39:11,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:11,978 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:11,978 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:11,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 941421370, now seen corresponding path program 39 times [2018-11-12 20:39:11,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:11,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:11,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 860 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:39:12,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:12,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:12,791 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:12,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:12,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:12,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:12,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:39:12,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:39:12,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:39:12,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:12,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 860 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:39:12,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 860 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:39:13,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:13,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-11-12 20:39:13,847 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:13,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:39:13,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:39:13,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:39:13,849 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 45 states. [2018-11-12 20:39:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:15,180 INFO L93 Difference]: Finished difference Result 312 states and 334 transitions. [2018-11-12 20:39:15,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:39:15,180 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 214 [2018-11-12 20:39:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:15,182 INFO L225 Difference]: With dead ends: 312 [2018-11-12 20:39:15,182 INFO L226 Difference]: Without dead ends: 219 [2018-11-12 20:39:15,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 387 SyntacticMatches, 42 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1057, Invalid=3365, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:39:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-12 20:39:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-12 20:39:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-12 20:39:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-11-12 20:39:15,194 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 214 [2018-11-12 20:39:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:15,195 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-11-12 20:39:15,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:39:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-11-12 20:39:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-12 20:39:15,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:15,196 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:15,196 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:15,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:15,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1446215476, now seen corresponding path program 40 times [2018-11-12 20:39:15,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:15,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:15,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:15,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:15,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 501 proven. 878 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-12 20:39:16,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:16,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:16,950 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:16,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:16,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:16,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:16,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:16,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:39:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:17,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 502 proven. 820 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:39:17,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 502 proven. 820 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:39:17,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:17,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 29 [2018-11-12 20:39:17,602 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:17,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:39:17,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:39:17,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=524, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:39:17,603 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 29 states. [2018-11-12 20:39:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:18,149 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-11-12 20:39:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:39:18,149 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 216 [2018-11-12 20:39:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:18,151 INFO L225 Difference]: With dead ends: 229 [2018-11-12 20:39:18,151 INFO L226 Difference]: Without dead ends: 227 [2018-11-12 20:39:18,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 410 SyntacticMatches, 43 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=301, Invalid=629, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:39:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-12 20:39:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-11-12 20:39:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-12 20:39:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-11-12 20:39:18,163 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 216 [2018-11-12 20:39:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:18,163 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-11-12 20:39:18,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:39:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-11-12 20:39:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-12 20:39:18,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:18,165 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:18,165 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:18,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1563073161, now seen corresponding path program 41 times [2018-11-12 20:39:18,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:18,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:18,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 945 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:39:19,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:19,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:19,866 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:19,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:19,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:19,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:19,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:39:19,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:39:20,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-12 20:39:20,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:20,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 945 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:39:20,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 945 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:39:20,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:20,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-11-12 20:39:20,672 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:20,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:39:20,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:39:20,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:39:20,674 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 47 states. [2018-11-12 20:39:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:22,183 INFO L93 Difference]: Finished difference Result 326 states and 349 transitions. [2018-11-12 20:39:22,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:39:22,183 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 224 [2018-11-12 20:39:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:22,184 INFO L225 Difference]: With dead ends: 326 [2018-11-12 20:39:22,184 INFO L226 Difference]: Without dead ends: 229 [2018-11-12 20:39:22,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 405 SyntacticMatches, 44 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1151, Invalid=3679, Unknown=0, NotChecked=0, Total=4830 [2018-11-12 20:39:22,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-12 20:39:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-11-12 20:39:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-12 20:39:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-11-12 20:39:22,196 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 224 [2018-11-12 20:39:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:22,196 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-11-12 20:39:22,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:39:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-11-12 20:39:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-12 20:39:22,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:22,198 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:22,198 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:22,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:22,198 INFO L82 PathProgramCache]: Analyzing trace with hash 835764465, now seen corresponding path program 42 times [2018-11-12 20:39:22,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:22,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:22,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:22,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:22,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 547 proven. 964 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-12 20:39:22,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:22,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:22,826 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:22,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:22,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:22,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:22,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:39:22,835 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:39:22,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:39:22,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:22,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 548 proven. 903 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:39:23,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 548 proven. 903 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:39:23,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:23,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 30 [2018-11-12 20:39:23,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:23,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:39:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:39:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:39:23,749 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 30 states. [2018-11-12 20:39:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:24,071 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2018-11-12 20:39:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:39:24,071 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 226 [2018-11-12 20:39:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:24,074 INFO L225 Difference]: With dead ends: 239 [2018-11-12 20:39:24,074 INFO L226 Difference]: Without dead ends: 237 [2018-11-12 20:39:24,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 429 SyntacticMatches, 45 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=325, Invalid=667, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:39:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-12 20:39:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-11-12 20:39:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-12 20:39:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-11-12 20:39:24,084 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 226 [2018-11-12 20:39:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:24,085 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-11-12 20:39:24,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:39:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-11-12 20:39:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-12 20:39:24,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:24,087 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:24,087 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:24,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1747425844, now seen corresponding path program 43 times [2018-11-12 20:39:24,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:24,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:24,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:24,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:24,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1034 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:39:25,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:25,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:25,336 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:25,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:25,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:25,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:25,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:25,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:39:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:25,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1034 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:39:25,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1034 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:39:26,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:26,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-11-12 20:39:26,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:26,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:39:26,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:39:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:39:26,173 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 49 states. [2018-11-12 20:39:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:27,478 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2018-11-12 20:39:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:39:27,478 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 234 [2018-11-12 20:39:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:27,480 INFO L225 Difference]: With dead ends: 340 [2018-11-12 20:39:27,480 INFO L226 Difference]: Without dead ends: 239 [2018-11-12 20:39:27,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 423 SyntacticMatches, 46 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1249, Invalid=4007, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:39:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-12 20:39:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-11-12 20:39:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-12 20:39:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-11-12 20:39:27,493 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 234 [2018-11-12 20:39:27,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:27,493 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-11-12 20:39:27,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:39:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-11-12 20:39:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-12 20:39:27,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:27,495 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:27,495 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:27,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:27,496 INFO L82 PathProgramCache]: Analyzing trace with hash -102079186, now seen corresponding path program 44 times [2018-11-12 20:39:27,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:27,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:27,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:27,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 595 proven. 1054 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-11-12 20:39:27,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:27,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:27,922 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:27,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:27,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:27,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:27,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:39:27,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:39:28,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-12 20:39:28,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:28,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 596 proven. 990 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:39:28,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 596 proven. 990 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:39:29,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:29,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 31 [2018-11-12 20:39:29,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:29,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:39:29,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:39:29,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=593, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:39:29,318 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 31 states. [2018-11-12 20:39:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:29,646 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-11-12 20:39:29,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 20:39:29,647 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 236 [2018-11-12 20:39:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:29,649 INFO L225 Difference]: With dead ends: 249 [2018-11-12 20:39:29,649 INFO L226 Difference]: Without dead ends: 247 [2018-11-12 20:39:29,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 448 SyntacticMatches, 47 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=350, Invalid=706, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:39:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-12 20:39:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-11-12 20:39:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-12 20:39:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-11-12 20:39:29,660 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 236 [2018-11-12 20:39:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:29,661 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-11-12 20:39:29,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:39:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-11-12 20:39:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-12 20:39:29,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:29,662 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:29,663 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:29,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:29,663 INFO L82 PathProgramCache]: Analyzing trace with hash 850112881, now seen corresponding path program 45 times [2018-11-12 20:39:29,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:29,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:29,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:29,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:29,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2691 backedges. 1127 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:39:30,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:30,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:30,581 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:30,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:30,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:30,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:30,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:39:30,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:39:30,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:39:30,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:30,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2691 backedges. 1127 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:39:30,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2691 backedges. 1127 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:39:32,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:32,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-11-12 20:39:32,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:32,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:39:32,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:39:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:39:32,099 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 51 states. [2018-11-12 20:39:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:32,890 INFO L93 Difference]: Finished difference Result 354 states and 379 transitions. [2018-11-12 20:39:32,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-12 20:39:32,890 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 244 [2018-11-12 20:39:32,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:32,892 INFO L225 Difference]: With dead ends: 354 [2018-11-12 20:39:32,892 INFO L226 Difference]: Without dead ends: 249 [2018-11-12 20:39:32,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 441 SyntacticMatches, 48 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1955 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1351, Invalid=4349, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:39:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-12 20:39:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-11-12 20:39:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-12 20:39:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-11-12 20:39:32,904 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 244 [2018-11-12 20:39:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:32,905 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-11-12 20:39:32,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:39:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-11-12 20:39:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-12 20:39:32,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:32,906 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:32,907 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:32,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:32,907 INFO L82 PathProgramCache]: Analyzing trace with hash -699364373, now seen corresponding path program 46 times [2018-11-12 20:39:32,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:32,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:32,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:32,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:32,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 645 proven. 1148 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-11-12 20:39:33,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:33,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:33,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:33,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:33,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:33,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:33,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:33,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:39:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:33,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 646 proven. 1081 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:39:33,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 646 proven. 1081 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:39:34,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:34,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 32 [2018-11-12 20:39:34,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:34,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:39:34,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:39:34,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=629, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:39:34,679 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 32 states. [2018-11-12 20:39:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:35,020 INFO L93 Difference]: Finished difference Result 259 states and 260 transitions. [2018-11-12 20:39:35,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:39:35,020 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 246 [2018-11-12 20:39:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:35,022 INFO L225 Difference]: With dead ends: 259 [2018-11-12 20:39:35,022 INFO L226 Difference]: Without dead ends: 257 [2018-11-12 20:39:35,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 467 SyntacticMatches, 49 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=376, Invalid=746, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:39:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-12 20:39:35,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-11-12 20:39:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-12 20:39:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-11-12 20:39:35,033 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 246 [2018-11-12 20:39:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:35,034 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-11-12 20:39:35,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:39:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-11-12 20:39:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-12 20:39:35,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:35,035 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:35,036 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:35,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash -401487058, now seen corresponding path program 47 times [2018-11-12 20:39:35,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:35,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:35,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:35,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:35,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1224 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:39:36,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:36,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:36,439 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:36,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:36,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:36,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:36,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:39:36,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:39:36,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-11-12 20:39:36,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:36,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1224 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:39:36,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1224 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:39:37,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:37,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-11-12 20:39:37,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:37,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-12 20:39:37,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-12 20:39:37,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:39:37,375 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 53 states. [2018-11-12 20:39:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:39,399 INFO L93 Difference]: Finished difference Result 368 states and 394 transitions. [2018-11-12 20:39:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 20:39:39,399 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 254 [2018-11-12 20:39:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:39,401 INFO L225 Difference]: With dead ends: 368 [2018-11-12 20:39:39,401 INFO L226 Difference]: Without dead ends: 259 [2018-11-12 20:39:39,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 459 SyntacticMatches, 50 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2124 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1457, Invalid=4705, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:39:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-12 20:39:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-11-12 20:39:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-12 20:39:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-11-12 20:39:39,414 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 254 [2018-11-12 20:39:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:39,414 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-11-12 20:39:39,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-12 20:39:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-11-12 20:39:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-12 20:39:39,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:39,416 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:39,416 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:39,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash 65754408, now seen corresponding path program 48 times [2018-11-12 20:39:39,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:39,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:39,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2978 backedges. 697 proven. 1246 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-11-12 20:39:39,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:39,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:39,882 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:39,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:39,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:39,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:39,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:39:39,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:39:39,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:39:39,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:39,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2978 backedges. 698 proven. 1176 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:39:40,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2978 backedges. 698 proven. 1176 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:39:40,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:40,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 33 [2018-11-12 20:39:40,700 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:40,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:39:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:39:40,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=666, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:39:40,701 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 33 states. [2018-11-12 20:39:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:41,026 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-11-12 20:39:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:39:41,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 256 [2018-11-12 20:39:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:41,029 INFO L225 Difference]: With dead ends: 269 [2018-11-12 20:39:41,029 INFO L226 Difference]: Without dead ends: 267 [2018-11-12 20:39:41,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 486 SyntacticMatches, 51 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:39:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-12 20:39:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-12 20:39:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-12 20:39:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-11-12 20:39:41,041 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 256 [2018-11-12 20:39:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:41,041 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-11-12 20:39:41,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:39:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-11-12 20:39:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-12 20:39:41,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:41,043 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:41,044 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:41,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash -350091413, now seen corresponding path program 49 times [2018-11-12 20:39:41,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:41,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:41,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:41,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:41,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3175 backedges. 1325 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:39:42,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:42,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:42,076 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:42,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:42,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:42,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 20:39:42,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:42,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:39:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:42,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3175 backedges. 1325 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:39:42,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3175 backedges. 1325 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:39:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:43,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-11-12 20:39:43,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:43,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-12 20:39:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-12 20:39:43,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:39:43,129 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 55 states. [2018-11-12 20:39:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:44,902 INFO L93 Difference]: Finished difference Result 382 states and 409 transitions. [2018-11-12 20:39:44,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-12 20:39:44,911 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 264 [2018-11-12 20:39:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:44,913 INFO L225 Difference]: With dead ends: 382 [2018-11-12 20:39:44,913 INFO L226 Difference]: Without dead ends: 269 [2018-11-12 20:39:44,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 477 SyntacticMatches, 52 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2300 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1567, Invalid=5075, Unknown=0, NotChecked=0, Total=6642 [2018-11-12 20:39:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-12 20:39:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-11-12 20:39:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-12 20:39:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-11-12 20:39:44,925 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 264 [2018-11-12 20:39:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:44,926 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-11-12 20:39:44,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-12 20:39:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-11-12 20:39:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-12 20:39:44,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:44,927 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:44,927 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:44,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:44,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1766137627, now seen corresponding path program 50 times [2018-11-12 20:39:44,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:44,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:44,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:44,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:44,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 751 proven. 1348 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-12 20:39:45,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:45,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:45,521 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:45,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:45,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:45,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:39:45,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:39:45,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:39:45,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-12 20:39:45,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:45,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 752 proven. 1275 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:39:45,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 752 proven. 1275 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:39:46,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:46,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 34 [2018-11-12 20:39:46,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:46,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:39:46,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:39:46,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=704, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:39:46,460 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 34 states. [2018-11-12 20:39:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:46,815 INFO L93 Difference]: Finished difference Result 279 states and 280 transitions. [2018-11-12 20:39:46,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:39:46,816 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 266 [2018-11-12 20:39:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:46,818 INFO L225 Difference]: With dead ends: 279 [2018-11-12 20:39:46,818 INFO L226 Difference]: Without dead ends: 277 [2018-11-12 20:39:46,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 505 SyntacticMatches, 53 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=431, Invalid=829, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:39:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-12 20:39:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-11-12 20:39:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-12 20:39:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-11-12 20:39:46,829 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 266 [2018-11-12 20:39:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:46,829 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-11-12 20:39:46,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:39:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-11-12 20:39:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-12 20:39:46,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:46,831 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:46,831 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:46,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash -574847448, now seen corresponding path program 51 times [2018-11-12 20:39:46,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:46,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:46,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:46,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1430 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:39:48,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:48,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:48,148 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:48,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:48,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:48,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:39:48,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:39:48,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:39:48,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:39:48,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:48,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1430 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:39:48,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1430 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:39:49,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:49,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-11-12 20:39:49,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:49,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-12 20:39:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-12 20:39:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=2379, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:39:49,852 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 57 states. [2018-11-12 20:39:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:51,333 INFO L93 Difference]: Finished difference Result 396 states and 424 transitions. [2018-11-12 20:39:51,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-12 20:39:51,334 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 274 [2018-11-12 20:39:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:51,335 INFO L225 Difference]: With dead ends: 396 [2018-11-12 20:39:51,335 INFO L226 Difference]: Without dead ends: 279 [2018-11-12 20:39:51,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 495 SyntacticMatches, 54 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1681, Invalid=5459, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:39:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-12 20:39:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-11-12 20:39:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-12 20:39:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-11-12 20:39:51,344 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 274 [2018-11-12 20:39:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:51,345 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-11-12 20:39:51,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-12 20:39:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-11-12 20:39:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-11-12 20:39:51,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:51,347 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:51,347 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:51,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:51,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1143517406, now seen corresponding path program 52 times [2018-11-12 20:39:51,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:51,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:51,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:51,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:51,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 807 proven. 1454 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-11-12 20:39:51,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:51,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:51,878 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:51,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:51,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:51,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:39:51,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:51,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:39:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:51,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 808 proven. 1378 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:39:52,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 808 proven. 1378 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:39:52,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:52,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 35 [2018-11-12 20:39:52,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:52,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:39:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:39:52,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=743, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:39:52,813 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 35 states. [2018-11-12 20:39:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:53,239 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-11-12 20:39:53,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:39:53,239 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 276 [2018-11-12 20:39:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:53,241 INFO L225 Difference]: With dead ends: 289 [2018-11-12 20:39:53,241 INFO L226 Difference]: Without dead ends: 287 [2018-11-12 20:39:53,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 524 SyntacticMatches, 55 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=460, Invalid=872, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:39:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-12 20:39:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-11-12 20:39:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-12 20:39:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-11-12 20:39:53,253 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 276 [2018-11-12 20:39:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:53,254 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-11-12 20:39:53,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:39:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-11-12 20:39:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-12 20:39:53,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:53,256 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:53,256 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:53,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:53,257 INFO L82 PathProgramCache]: Analyzing trace with hash -489068699, now seen corresponding path program 53 times [2018-11-12 20:39:53,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:53,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:53,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:39:53,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:53,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 1539 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:39:54,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:54,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:54,427 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:54,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:54,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:54,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:39:54,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:39:54,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:39:54,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-12 20:39:54,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:54,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 1539 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:39:54,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 1539 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:39:55,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:55,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-11-12 20:39:55,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:55,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-12 20:39:55,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-12 20:39:55,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:39:55,635 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 59 states. [2018-11-12 20:39:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:56,914 INFO L93 Difference]: Finished difference Result 410 states and 439 transitions. [2018-11-12 20:39:56,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-12 20:39:56,915 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 284 [2018-11-12 20:39:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:56,916 INFO L225 Difference]: With dead ends: 410 [2018-11-12 20:39:56,916 INFO L226 Difference]: Without dead ends: 289 [2018-11-12 20:39:56,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 513 SyntacticMatches, 56 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1799, Invalid=5857, Unknown=0, NotChecked=0, Total=7656 [2018-11-12 20:39:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-12 20:39:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-11-12 20:39:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-12 20:39:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-11-12 20:39:56,930 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-11-12 20:39:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:56,930 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-11-12 20:39:56,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-12 20:39:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-11-12 20:39:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-12 20:39:56,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:56,933 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:56,933 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:56,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:56,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2070986719, now seen corresponding path program 54 times [2018-11-12 20:39:56,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:56,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:56,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:56,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:39:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3755 backedges. 865 proven. 1564 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-11-12 20:39:57,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:57,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:39:57,429 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:39:57,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:39:57,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:39:57,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:39:57,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:39:57,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:39:57,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:39:57,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:39:57,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:39:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3755 backedges. 866 proven. 1485 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:39:57,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:39:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3755 backedges. 866 proven. 1485 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:39:58,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:39:58,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 36 [2018-11-12 20:39:58,327 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:39:58,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:39:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:39:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:39:58,328 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 36 states. [2018-11-12 20:39:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:39:58,732 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-11-12 20:39:58,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:39:58,733 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 286 [2018-11-12 20:39:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:39:58,735 INFO L225 Difference]: With dead ends: 299 [2018-11-12 20:39:58,735 INFO L226 Difference]: Without dead ends: 297 [2018-11-12 20:39:58,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 543 SyntacticMatches, 57 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=490, Invalid=916, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:39:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-12 20:39:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-11-12 20:39:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-12 20:39:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-11-12 20:39:58,747 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 286 [2018-11-12 20:39:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:39:58,747 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-11-12 20:39:58,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:39:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-11-12 20:39:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-12 20:39:58,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:39:58,749 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:39:58,750 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:39:58,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:39:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1619577634, now seen corresponding path program 55 times [2018-11-12 20:39:58,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:39:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:58,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:39:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:39:58,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:39:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1652 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:40:00,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:00,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:00,387 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:00,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:00,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:00,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:00,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:00,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:00,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1652 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:40:00,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1652 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:40:01,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:01,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-11-12 20:40:01,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:01,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-12 20:40:01,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-12 20:40:01,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:40:01,673 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 61 states. [2018-11-12 20:40:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:03,297 INFO L93 Difference]: Finished difference Result 424 states and 454 transitions. [2018-11-12 20:40:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-12 20:40:03,297 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 294 [2018-11-12 20:40:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:03,298 INFO L225 Difference]: With dead ends: 424 [2018-11-12 20:40:03,299 INFO L226 Difference]: Without dead ends: 299 [2018-11-12 20:40:03,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 531 SyntacticMatches, 58 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2870 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1921, Invalid=6269, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:40:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-12 20:40:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-11-12 20:40:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-12 20:40:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-11-12 20:40:03,311 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-11-12 20:40:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:03,311 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-11-12 20:40:03,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-12 20:40:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-11-12 20:40:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-12 20:40:03,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:03,313 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:03,313 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:03,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash -87076068, now seen corresponding path program 56 times [2018-11-12 20:40:03,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:03,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:03,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4034 backedges. 925 proven. 1678 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-11-12 20:40:04,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:04,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:04,627 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:04,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:04,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:04,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:04,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:04,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:04,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-12 20:40:04,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:04,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4034 backedges. 926 proven. 1596 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:40:04,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4034 backedges. 926 proven. 1596 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:40:05,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:05,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 37 [2018-11-12 20:40:05,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:05,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:40:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:40:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=824, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:40:05,703 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 37 states. [2018-11-12 20:40:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:06,117 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-11-12 20:40:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-12 20:40:06,117 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 296 [2018-11-12 20:40:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:06,119 INFO L225 Difference]: With dead ends: 309 [2018-11-12 20:40:06,119 INFO L226 Difference]: Without dead ends: 307 [2018-11-12 20:40:06,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 562 SyntacticMatches, 59 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=521, Invalid=961, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:40:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-12 20:40:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-12 20:40:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-12 20:40:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-11-12 20:40:06,132 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 296 [2018-11-12 20:40:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:06,133 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-11-12 20:40:06,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:40:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-11-12 20:40:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-12 20:40:06,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:06,135 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:06,135 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:06,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:06,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1106432351, now seen corresponding path program 57 times [2018-11-12 20:40:06,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:06,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:06,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1769 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:40:07,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:07,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:07,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:07,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:07,313 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:07,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:07,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:07,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:07,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1769 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:40:07,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1769 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:40:08,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:08,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-11-12 20:40:08,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:08,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-12 20:40:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-12 20:40:08,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2018-11-12 20:40:08,613 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 63 states. [2018-11-12 20:40:10,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:10,639 INFO L93 Difference]: Finished difference Result 438 states and 469 transitions. [2018-11-12 20:40:10,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-12 20:40:10,640 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 304 [2018-11-12 20:40:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:10,641 INFO L225 Difference]: With dead ends: 438 [2018-11-12 20:40:10,641 INFO L226 Difference]: Without dead ends: 309 [2018-11-12 20:40:10,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 549 SyntacticMatches, 60 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3074 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2047, Invalid=6695, Unknown=0, NotChecked=0, Total=8742 [2018-11-12 20:40:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-12 20:40:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-11-12 20:40:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-12 20:40:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-11-12 20:40:10,654 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 304 [2018-11-12 20:40:10,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:10,654 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-11-12 20:40:10,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-12 20:40:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-11-12 20:40:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-12 20:40:10,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:10,656 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:10,657 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:10,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1045637337, now seen corresponding path program 58 times [2018-11-12 20:40:10,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:10,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:10,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 987 proven. 1796 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-11-12 20:40:11,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:11,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:11,197 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:11,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:11,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:11,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:11,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:11,205 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:11,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 988 proven. 1711 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:40:11,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 988 proven. 1711 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:40:12,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:12,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 38 [2018-11-12 20:40:12,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:12,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:40:12,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:40:12,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=866, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:40:12,227 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 38 states. [2018-11-12 20:40:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:12,672 INFO L93 Difference]: Finished difference Result 319 states and 320 transitions. [2018-11-12 20:40:12,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:40:12,672 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 306 [2018-11-12 20:40:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:12,674 INFO L225 Difference]: With dead ends: 319 [2018-11-12 20:40:12,675 INFO L226 Difference]: Without dead ends: 317 [2018-11-12 20:40:12,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 581 SyntacticMatches, 61 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=553, Invalid=1007, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:40:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-11-12 20:40:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-11-12 20:40:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-12 20:40:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-11-12 20:40:12,685 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 306 [2018-11-12 20:40:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:12,685 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-11-12 20:40:12,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:40:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-11-12 20:40:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-12 20:40:12,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:12,687 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:12,687 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:12,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:12,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1185441252, now seen corresponding path program 59 times [2018-11-12 20:40:12,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:12,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:12,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1890 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:40:14,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:14,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:14,031 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:14,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:14,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:14,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:14,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:14,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:14,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-11-12 20:40:14,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:14,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1890 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:40:14,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1890 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:40:15,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:15,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-11-12 20:40:15,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:15,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-12 20:40:15,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-12 20:40:15,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2018-11-12 20:40:15,742 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 65 states. [2018-11-12 20:40:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:17,106 INFO L93 Difference]: Finished difference Result 452 states and 484 transitions. [2018-11-12 20:40:17,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-12 20:40:17,106 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 314 [2018-11-12 20:40:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:17,108 INFO L225 Difference]: With dead ends: 452 [2018-11-12 20:40:17,108 INFO L226 Difference]: Without dead ends: 319 [2018-11-12 20:40:17,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 567 SyntacticMatches, 62 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3285 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2177, Invalid=7135, Unknown=0, NotChecked=0, Total=9312 [2018-11-12 20:40:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-12 20:40:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-11-12 20:40:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-12 20:40:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-11-12 20:40:17,119 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 314 [2018-11-12 20:40:17,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:17,120 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-11-12 20:40:17,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-12 20:40:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-11-12 20:40:17,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-12 20:40:17,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:17,122 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:17,122 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:17,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:17,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1802789142, now seen corresponding path program 60 times [2018-11-12 20:40:17,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:17,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:17,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:17,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:17,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4622 backedges. 1051 proven. 1918 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-11-12 20:40:17,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:17,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:17,805 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:17,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:17,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:17,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:17,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:17,814 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:17,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:17,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:17,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4622 backedges. 1052 proven. 1830 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:40:18,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4622 backedges. 1052 proven. 1830 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:40:18,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:18,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 39 [2018-11-12 20:40:18,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:18,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:40:18,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:40:18,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:40:18,884 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 39 states. [2018-11-12 20:40:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:19,323 INFO L93 Difference]: Finished difference Result 329 states and 330 transitions. [2018-11-12 20:40:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:40:19,324 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 316 [2018-11-12 20:40:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:19,326 INFO L225 Difference]: With dead ends: 329 [2018-11-12 20:40:19,326 INFO L226 Difference]: Without dead ends: 327 [2018-11-12 20:40:19,327 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 600 SyntacticMatches, 63 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=586, Invalid=1054, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:40:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-12 20:40:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-11-12 20:40:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-11-12 20:40:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-11-12 20:40:19,338 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 316 [2018-11-12 20:40:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:19,339 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-11-12 20:40:19,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:40:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-11-12 20:40:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-12 20:40:19,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:19,341 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:19,341 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:19,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:19,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2112928423, now seen corresponding path program 61 times [2018-11-12 20:40:19,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:19,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:19,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4867 backedges. 2015 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:40:20,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:20,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:20,900 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:20,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:20,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:20,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:20,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:20,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:21,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4867 backedges. 2015 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:40:21,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4867 backedges. 2015 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:40:22,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:22,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-11-12 20:40:22,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:22,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-12 20:40:22,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-12 20:40:22,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:40:22,488 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 67 states. [2018-11-12 20:40:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:24,443 INFO L93 Difference]: Finished difference Result 466 states and 499 transitions. [2018-11-12 20:40:24,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-12 20:40:24,443 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 324 [2018-11-12 20:40:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:24,445 INFO L225 Difference]: With dead ends: 466 [2018-11-12 20:40:24,445 INFO L226 Difference]: Without dead ends: 329 [2018-11-12 20:40:24,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 585 SyntacticMatches, 64 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3503 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2311, Invalid=7589, Unknown=0, NotChecked=0, Total=9900 [2018-11-12 20:40:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-12 20:40:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-11-12 20:40:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-12 20:40:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-11-12 20:40:24,460 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 324 [2018-11-12 20:40:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:24,460 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-11-12 20:40:24,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-12 20:40:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-11-12 20:40:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-12 20:40:24,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:24,463 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:24,463 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:24,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1966924845, now seen corresponding path program 62 times [2018-11-12 20:40:24,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 1117 proven. 2044 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-11-12 20:40:25,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:25,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:25,651 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:25,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:25,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:25,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:25,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:25,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:25,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-12 20:40:25,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:25,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 1118 proven. 1953 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:40:25,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 1118 proven. 1953 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:40:26,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:26,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 40 [2018-11-12 20:40:26,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:26,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:40:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:40:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=953, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:40:26,843 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 40 states. [2018-11-12 20:40:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:27,259 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-11-12 20:40:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:40:27,259 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 326 [2018-11-12 20:40:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:27,262 INFO L225 Difference]: With dead ends: 339 [2018-11-12 20:40:27,262 INFO L226 Difference]: Without dead ends: 337 [2018-11-12 20:40:27,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 619 SyntacticMatches, 65 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=620, Invalid=1102, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:40:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-12 20:40:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-11-12 20:40:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-12 20:40:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-11-12 20:40:27,278 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 326 [2018-11-12 20:40:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:27,278 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-11-12 20:40:27,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:40:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-11-12 20:40:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-12 20:40:27,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:27,281 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:27,281 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:27,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:27,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1568017642, now seen corresponding path program 63 times [2018-11-12 20:40:27,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:27,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:27,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:27,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:27,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2144 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:40:28,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:28,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:28,994 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:28,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:28,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:28,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:29,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:29,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:29,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:29,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:29,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2144 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:40:29,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2144 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:40:30,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:30,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-11-12 20:40:30,914 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:30,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-12 20:40:30,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-12 20:40:30,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1191, Invalid=3501, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:40:30,915 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 69 states. [2018-11-12 20:40:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:32,958 INFO L93 Difference]: Finished difference Result 480 states and 514 transitions. [2018-11-12 20:40:32,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-12 20:40:32,958 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 334 [2018-11-12 20:40:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:32,960 INFO L225 Difference]: With dead ends: 480 [2018-11-12 20:40:32,960 INFO L226 Difference]: Without dead ends: 339 [2018-11-12 20:40:32,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 603 SyntacticMatches, 66 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3728 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2449, Invalid=8057, Unknown=0, NotChecked=0, Total=10506 [2018-11-12 20:40:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-12 20:40:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-11-12 20:40:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-11-12 20:40:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-11-12 20:40:32,972 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 334 [2018-11-12 20:40:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:32,973 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-11-12 20:40:32,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-12 20:40:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-11-12 20:40:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-11-12 20:40:32,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:32,974 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:32,974 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:32,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash -907577072, now seen corresponding path program 64 times [2018-11-12 20:40:32,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:32,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:32,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:32,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:32,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 1185 proven. 2174 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-11-12 20:40:33,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:33,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:33,598 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:33,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:33,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:33,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:33,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:33,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:33,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 1186 proven. 2080 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:40:33,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 1186 proven. 2080 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:40:34,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:34,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 41 [2018-11-12 20:40:34,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:34,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:40:34,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:40:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=998, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:40:34,851 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 41 states. [2018-11-12 20:40:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:35,462 INFO L93 Difference]: Finished difference Result 349 states and 350 transitions. [2018-11-12 20:40:35,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 20:40:35,462 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 336 [2018-11-12 20:40:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:35,465 INFO L225 Difference]: With dead ends: 349 [2018-11-12 20:40:35,465 INFO L226 Difference]: Without dead ends: 347 [2018-11-12 20:40:35,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 638 SyntacticMatches, 67 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:40:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-12 20:40:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-11-12 20:40:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-12 20:40:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-11-12 20:40:35,479 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 336 [2018-11-12 20:40:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:35,479 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-11-12 20:40:35,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:40:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-11-12 20:40:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-12 20:40:35,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:35,481 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:35,481 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:35,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1370504365, now seen corresponding path program 65 times [2018-11-12 20:40:35,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:35,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:35,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 2277 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:40:37,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:37,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:37,031 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:37,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:37,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:37,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:37,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:37,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:37,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-12 20:40:37,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:37,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 2277 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:40:37,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 2277 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:40:38,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:38,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-11-12 20:40:38,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:38,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-12 20:40:38,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-12 20:40:38,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2018-11-12 20:40:38,658 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 71 states. [2018-11-12 20:40:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:40,386 INFO L93 Difference]: Finished difference Result 494 states and 529 transitions. [2018-11-12 20:40:40,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-12 20:40:40,386 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 344 [2018-11-12 20:40:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:40,388 INFO L225 Difference]: With dead ends: 494 [2018-11-12 20:40:40,388 INFO L226 Difference]: Without dead ends: 349 [2018-11-12 20:40:40,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 621 SyntacticMatches, 68 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2591, Invalid=8539, Unknown=0, NotChecked=0, Total=11130 [2018-11-12 20:40:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-12 20:40:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-11-12 20:40:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-11-12 20:40:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-11-12 20:40:40,407 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 344 [2018-11-12 20:40:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:40,408 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-11-12 20:40:40,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-12 20:40:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-11-12 20:40:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-12 20:40:40,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:40,409 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:40,410 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:40,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:40,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1034000589, now seen corresponding path program 66 times [2018-11-12 20:40:40,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:40,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:40,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 1255 proven. 2308 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-11-12 20:40:41,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:41,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:41,183 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:41,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:41,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:41,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:41,191 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:41,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:41,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:41,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:41,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 1256 proven. 2211 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:40:41,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 1256 proven. 2211 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:40:42,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:42,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 42 [2018-11-12 20:40:42,442 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:42,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:40:42,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:40:42,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=1044, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:40:42,443 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 42 states. [2018-11-12 20:40:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:42,866 INFO L93 Difference]: Finished difference Result 359 states and 360 transitions. [2018-11-12 20:40:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:40:42,866 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 346 [2018-11-12 20:40:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:42,868 INFO L225 Difference]: With dead ends: 359 [2018-11-12 20:40:42,868 INFO L226 Difference]: Without dead ends: 357 [2018-11-12 20:40:42,869 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 657 SyntacticMatches, 69 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=691, Invalid=1201, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:40:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-12 20:40:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-11-12 20:40:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-11-12 20:40:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-11-12 20:40:42,880 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 346 [2018-11-12 20:40:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:42,880 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-11-12 20:40:42,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:40:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-11-12 20:40:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-12 20:40:42,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:42,882 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:42,883 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:42,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2013211120, now seen corresponding path program 67 times [2018-11-12 20:40:42,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:42,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:42,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 2414 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:40:44,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:44,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:44,506 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:44,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:44,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:44,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:44,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:44,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:44,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 2414 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:40:44,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 2414 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:40:46,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:46,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-11-12 20:40:46,425 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:46,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-12 20:40:46,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-12 20:40:46,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=3923, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:40:46,426 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 73 states. [2018-11-12 20:40:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:48,006 INFO L93 Difference]: Finished difference Result 508 states and 544 transitions. [2018-11-12 20:40:48,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-12 20:40:48,006 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 354 [2018-11-12 20:40:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:48,008 INFO L225 Difference]: With dead ends: 508 [2018-11-12 20:40:48,008 INFO L226 Difference]: Without dead ends: 359 [2018-11-12 20:40:48,010 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 639 SyntacticMatches, 70 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4199 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2737, Invalid=9035, Unknown=0, NotChecked=0, Total=11772 [2018-11-12 20:40:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-11-12 20:40:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-11-12 20:40:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-12 20:40:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-11-12 20:40:48,023 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 354 [2018-11-12 20:40:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:48,023 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-11-12 20:40:48,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-12 20:40:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-11-12 20:40:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-12 20:40:48,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:48,025 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:48,025 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:48,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:48,025 INFO L82 PathProgramCache]: Analyzing trace with hash 600414986, now seen corresponding path program 68 times [2018-11-12 20:40:48,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:48,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:48,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:48,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:48,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5918 backedges. 1327 proven. 2446 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-11-12 20:40:48,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:48,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:48,757 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:48,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:48,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:48,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:48,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:48,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:48,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-12 20:40:48,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:48,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5918 backedges. 1328 proven. 2346 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:40:49,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5918 backedges. 1328 proven. 2346 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:40:50,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:50,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 43 [2018-11-12 20:40:50,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:50,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:40:50,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:40:50,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1091, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:40:50,106 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 43 states. [2018-11-12 20:40:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:50,645 INFO L93 Difference]: Finished difference Result 369 states and 370 transitions. [2018-11-12 20:40:50,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 20:40:50,645 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 356 [2018-11-12 20:40:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:50,646 INFO L225 Difference]: With dead ends: 369 [2018-11-12 20:40:50,646 INFO L226 Difference]: Without dead ends: 367 [2018-11-12 20:40:50,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 676 SyntacticMatches, 71 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1252, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:40:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-12 20:40:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-11-12 20:40:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-12 20:40:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-11-12 20:40:50,658 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 356 [2018-11-12 20:40:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:50,658 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-11-12 20:40:50,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:40:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-11-12 20:40:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-12 20:40:50,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:50,660 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:50,660 INFO L423 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:50,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:50,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1554691251, now seen corresponding path program 69 times [2018-11-12 20:40:50,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:50,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:50,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:50,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:50,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2555 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:40:52,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:52,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:52,354 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:52,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:52,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:52,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:52,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:52,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:52,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:52,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:52,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2555 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:40:52,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2555 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:40:54,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:54,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-11-12 20:40:54,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:54,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-12 20:40:54,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-12 20:40:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:40:54,117 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 75 states. [2018-11-12 20:40:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:56,724 INFO L93 Difference]: Finished difference Result 522 states and 559 transitions. [2018-11-12 20:40:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-12 20:40:56,724 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 364 [2018-11-12 20:40:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:56,726 INFO L225 Difference]: With dead ends: 522 [2018-11-12 20:40:56,726 INFO L226 Difference]: Without dead ends: 369 [2018-11-12 20:40:56,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 657 SyntacticMatches, 72 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4445 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2887, Invalid=9545, Unknown=0, NotChecked=0, Total=12432 [2018-11-12 20:40:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-12 20:40:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-11-12 20:40:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-12 20:40:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-11-12 20:40:56,745 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 364 [2018-11-12 20:40:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:56,745 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-11-12 20:40:56,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-12 20:40:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-11-12 20:40:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-11-12 20:40:56,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:56,748 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:56,748 INFO L423 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:56,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1521508409, now seen corresponding path program 70 times [2018-11-12 20:40:56,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:56,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:56,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:56,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:56,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6267 backedges. 1401 proven. 2588 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-11-12 20:40:57,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:57,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:57,462 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:57,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:57,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:57,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:57,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:57,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:57,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6267 backedges. 1402 proven. 2485 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:40:57,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6267 backedges. 1402 proven. 2485 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:40:59,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:59,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 44 [2018-11-12 20:40:59,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:59,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:40:59,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:40:59,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=1139, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:40:59,025 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 44 states. [2018-11-12 20:40:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:59,557 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2018-11-12 20:40:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:40:59,558 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 366 [2018-11-12 20:40:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:59,560 INFO L225 Difference]: With dead ends: 379 [2018-11-12 20:40:59,560 INFO L226 Difference]: Without dead ends: 377 [2018-11-12 20:40:59,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 695 SyntacticMatches, 73 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=766, Invalid=1304, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:40:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-11-12 20:40:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-11-12 20:40:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-12 20:40:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-11-12 20:40:59,572 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 366 [2018-11-12 20:40:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:59,572 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-11-12 20:40:59,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:40:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-11-12 20:40:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-11-12 20:40:59,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:59,574 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:59,574 INFO L423 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:59,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash -954383606, now seen corresponding path program 71 times [2018-11-12 20:40:59,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:59,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:59,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2700 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:41:01,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:01,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:01,478 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:01,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:01,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:01,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:01,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:01,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:01,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-11-12 20:41:01,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:01,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2700 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:41:01,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2700 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:41:03,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:03,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-11-12 20:41:03,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:03,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-12 20:41:03,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-12 20:41:03,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4369, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:41:03,414 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 77 states. [2018-11-12 20:41:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:05,973 INFO L93 Difference]: Finished difference Result 536 states and 574 transitions. [2018-11-12 20:41:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-12 20:41:05,973 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 374 [2018-11-12 20:41:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:05,974 INFO L225 Difference]: With dead ends: 536 [2018-11-12 20:41:05,974 INFO L226 Difference]: Without dead ends: 379 [2018-11-12 20:41:05,976 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 675 SyntacticMatches, 74 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4698 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3041, Invalid=10069, Unknown=0, NotChecked=0, Total=13110 [2018-11-12 20:41:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-12 20:41:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-12 20:41:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-12 20:41:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-11-12 20:41:05,992 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 374 [2018-11-12 20:41:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:05,992 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-11-12 20:41:05,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-12 20:41:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-11-12 20:41:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-11-12 20:41:05,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:05,994 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:05,994 INFO L423 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:05,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:05,995 INFO L82 PathProgramCache]: Analyzing trace with hash 406570756, now seen corresponding path program 72 times [2018-11-12 20:41:05,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:05,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:05,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:05,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:05,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 1477 proven. 2734 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-11-12 20:41:06,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:06,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:06,848 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:06,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:06,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:06,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:06,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:06,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:06,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:06,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:06,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 1478 proven. 2628 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:41:07,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 1478 proven. 2628 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:41:08,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:08,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 45 [2018-11-12 20:41:08,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:08,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:41:08,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:41:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=1188, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:41:08,348 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 45 states. [2018-11-12 20:41:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:08,814 INFO L93 Difference]: Finished difference Result 389 states and 390 transitions. [2018-11-12 20:41:08,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:41:08,815 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 376 [2018-11-12 20:41:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:08,817 INFO L225 Difference]: With dead ends: 389 [2018-11-12 20:41:08,817 INFO L226 Difference]: Without dead ends: 387 [2018-11-12 20:41:08,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 714 SyntacticMatches, 75 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1669 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=805, Invalid=1357, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:41:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-12 20:41:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-11-12 20:41:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-12 20:41:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-11-12 20:41:08,835 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 376 [2018-11-12 20:41:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:08,835 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-11-12 20:41:08,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:41:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-11-12 20:41:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-11-12 20:41:08,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:08,838 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:08,838 INFO L423 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:08,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1329651015, now seen corresponding path program 73 times [2018-11-12 20:41:08,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:08,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:08,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:08,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:08,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6919 backedges. 2849 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:41:10,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:10,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:10,641 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:10,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:10,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:10,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:10,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:10,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:10,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6919 backedges. 2849 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:41:10,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6919 backedges. 2849 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:41:12,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:12,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-11-12 20:41:12,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:12,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-12 20:41:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-12 20:41:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:41:12,847 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 79 states. [2018-11-12 20:41:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:15,517 INFO L93 Difference]: Finished difference Result 550 states and 589 transitions. [2018-11-12 20:41:15,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-11-12 20:41:15,524 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 384 [2018-11-12 20:41:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:15,526 INFO L225 Difference]: With dead ends: 550 [2018-11-12 20:41:15,526 INFO L226 Difference]: Without dead ends: 389 [2018-11-12 20:41:15,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 693 SyntacticMatches, 76 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4958 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3199, Invalid=10607, Unknown=0, NotChecked=0, Total=13806 [2018-11-12 20:41:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-11-12 20:41:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-11-12 20:41:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-12 20:41:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-11-12 20:41:15,546 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 384 [2018-11-12 20:41:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:15,546 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-11-12 20:41:15,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-12 20:41:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-11-12 20:41:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-11-12 20:41:15,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:15,549 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:15,549 INFO L423 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:15,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1045548863, now seen corresponding path program 74 times [2018-11-12 20:41:15,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:15,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:15,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:15,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:15,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 1555 proven. 2884 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-11-12 20:41:16,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:16,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:16,719 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:16,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:16,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:16,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:16,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:16,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:16,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-12 20:41:16,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:16,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 1556 proven. 2775 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:41:17,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 1556 proven. 2775 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:41:18,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:18,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 46 [2018-11-12 20:41:18,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:18,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:41:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:41:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=1238, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:41:18,327 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 46 states. [2018-11-12 20:41:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:18,873 INFO L93 Difference]: Finished difference Result 399 states and 400 transitions. [2018-11-12 20:41:18,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:41:18,873 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 386 [2018-11-12 20:41:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:18,876 INFO L225 Difference]: With dead ends: 399 [2018-11-12 20:41:18,876 INFO L226 Difference]: Without dead ends: 397 [2018-11-12 20:41:18,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 733 SyntacticMatches, 77 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=845, Invalid=1411, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:41:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-12 20:41:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-11-12 20:41:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-11-12 20:41:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-11-12 20:41:18,889 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 386 [2018-11-12 20:41:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:18,890 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-11-12 20:41:18,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:41:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-11-12 20:41:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-11-12 20:41:18,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:18,892 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:18,892 INFO L423 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:18,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash -289392124, now seen corresponding path program 75 times [2018-11-12 20:41:18,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:18,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:18,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:18,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:18,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7296 backedges. 3002 proven. 1482 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2018-11-12 20:41:20,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:20,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:20,687 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:20,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:20,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:20,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:20,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:20,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:20,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:20,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:20,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7296 backedges. 3002 proven. 1482 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2018-11-12 20:41:20,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7296 backedges. 3002 proven. 1482 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2018-11-12 20:41:23,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:23,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 81 [2018-11-12 20:41:23,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:23,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-12 20:41:23,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-12 20:41:23,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1641, Invalid=4839, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:41:23,018 INFO L87 Difference]: Start difference. First operand 397 states and 398 transitions. Second operand 81 states. [2018-11-12 20:41:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:26,000 INFO L93 Difference]: Finished difference Result 564 states and 604 transitions. [2018-11-12 20:41:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-12 20:41:26,001 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 394 [2018-11-12 20:41:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:26,003 INFO L225 Difference]: With dead ends: 564 [2018-11-12 20:41:26,003 INFO L226 Difference]: Without dead ends: 399 [2018-11-12 20:41:26,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 711 SyntacticMatches, 78 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5225 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3361, Invalid=11159, Unknown=0, NotChecked=0, Total=14520 [2018-11-12 20:41:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-12 20:41:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-11-12 20:41:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-12 20:41:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-11-12 20:41:26,019 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 394 [2018-11-12 20:41:26,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:26,019 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-11-12 20:41:26,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-12 20:41:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-11-12 20:41:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-12 20:41:26,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:26,022 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:26,022 INFO L423 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:26,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash 400489726, now seen corresponding path program 76 times [2018-11-12 20:41:26,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:26,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:26,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:26,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:26,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7374 backedges. 1635 proven. 3038 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-11-12 20:41:27,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:27,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:27,133 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:27,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:27,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:27,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:27,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:27,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:27,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7374 backedges. 1636 proven. 2926 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2018-11-12 20:41:27,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7374 backedges. 1636 proven. 2926 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2018-11-12 20:41:28,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:28,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 47 [2018-11-12 20:41:28,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:28,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:41:28,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:41:28,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=873, Invalid=1289, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:41:28,754 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 47 states. [2018-11-12 20:41:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:29,344 INFO L93 Difference]: Finished difference Result 409 states and 410 transitions. [2018-11-12 20:41:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:41:29,344 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 396 [2018-11-12 20:41:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:29,346 INFO L225 Difference]: With dead ends: 409 [2018-11-12 20:41:29,346 INFO L226 Difference]: Without dead ends: 407 [2018-11-12 20:41:29,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 752 SyntacticMatches, 79 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1837 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=886, Invalid=1466, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:41:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-12 20:41:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-11-12 20:41:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-12 20:41:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-11-12 20:41:29,360 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 396 [2018-11-12 20:41:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:29,360 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-11-12 20:41:29,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:41:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-11-12 20:41:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-12 20:41:29,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:29,362 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:29,363 INFO L423 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:29,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash -239896255, now seen corresponding path program 77 times [2018-11-12 20:41:29,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:29,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:29,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:29,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:29,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7683 backedges. 3159 proven. 1560 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-12 20:41:31,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:31,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:31,523 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:31,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:31,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:31,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:31,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:31,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:31,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-12 20:41:31,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:31,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7683 backedges. 3159 proven. 1560 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-12 20:41:31,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7683 backedges. 3159 proven. 1560 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-12 20:41:33,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:33,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 83 [2018-11-12 20:41:33,812 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:33,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-11-12 20:41:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-11-12 20:41:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2018-11-12 20:41:33,813 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 83 states. [2018-11-12 20:41:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:37,194 INFO L93 Difference]: Finished difference Result 578 states and 619 transitions. [2018-11-12 20:41:37,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-11-12 20:41:37,194 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 404 [2018-11-12 20:41:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:37,196 INFO L225 Difference]: With dead ends: 578 [2018-11-12 20:41:37,196 INFO L226 Difference]: Without dead ends: 409 [2018-11-12 20:41:37,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 729 SyntacticMatches, 80 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5499 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3527, Invalid=11725, Unknown=0, NotChecked=0, Total=15252 [2018-11-12 20:41:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-12 20:41:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-11-12 20:41:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-11-12 20:41:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-11-12 20:41:37,211 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 404 [2018-11-12 20:41:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:37,212 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-11-12 20:41:37,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-11-12 20:41:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-11-12 20:41:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-11-12 20:41:37,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:37,214 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:37,214 INFO L423 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:37,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2078389317, now seen corresponding path program 78 times [2018-11-12 20:41:37,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:37,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:37,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:37,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:37,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 1717 proven. 3196 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-11-12 20:41:38,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:38,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:38,302 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:38,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:38,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:38,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:38,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:38,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:38,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:38,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:38,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 1718 proven. 3081 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-12 20:41:38,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 1718 proven. 3081 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2018-11-12 20:41:39,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:39,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 48 [2018-11-12 20:41:39,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:39,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:41:39,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:41:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=915, Invalid=1341, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:41:39,937 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 48 states. [2018-11-12 20:41:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:40,481 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-11-12 20:41:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:41:40,482 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 406 [2018-11-12 20:41:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:40,485 INFO L225 Difference]: With dead ends: 419 [2018-11-12 20:41:40,485 INFO L226 Difference]: Without dead ends: 417 [2018-11-12 20:41:40,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 771 SyntacticMatches, 81 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=928, Invalid=1522, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:41:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-12 20:41:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-11-12 20:41:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-12 20:41:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-11-12 20:41:40,499 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 406 [2018-11-12 20:41:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:40,499 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-11-12 20:41:40,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:41:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-11-12 20:41:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-12 20:41:40,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:40,501 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:40,501 INFO L423 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:40,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:40,501 INFO L82 PathProgramCache]: Analyzing trace with hash -11879682, now seen corresponding path program 79 times [2018-11-12 20:41:40,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:40,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:40,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:40,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:40,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8080 backedges. 3320 proven. 1640 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-11-12 20:41:42,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:42,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:42,799 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:42,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:42,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:42,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:42,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:42,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:42,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8080 backedges. 3320 proven. 1640 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-11-12 20:41:43,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8080 backedges. 3320 proven. 1640 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-11-12 20:41:45,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:45,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 85 [2018-11-12 20:41:45,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:45,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-12 20:41:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-12 20:41:45,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1807, Invalid=5333, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:41:45,069 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 85 states. [2018-11-12 20:41:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:48,410 INFO L93 Difference]: Finished difference Result 592 states and 634 transitions. [2018-11-12 20:41:48,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-12 20:41:48,412 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 414 [2018-11-12 20:41:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:48,414 INFO L225 Difference]: With dead ends: 592 [2018-11-12 20:41:48,414 INFO L226 Difference]: Without dead ends: 419 [2018-11-12 20:41:48,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 747 SyntacticMatches, 82 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5780 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3697, Invalid=12305, Unknown=0, NotChecked=0, Total=16002 [2018-11-12 20:41:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-12 20:41:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-11-12 20:41:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-12 20:41:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 420 transitions. [2018-11-12 20:41:48,431 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 420 transitions. Word has length 414 [2018-11-12 20:41:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:48,431 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 420 transitions. [2018-11-12 20:41:48,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-12 20:41:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 420 transitions. [2018-11-12 20:41:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-11-12 20:41:48,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:48,433 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:48,433 INFO L423 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:48,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1529594632, now seen corresponding path program 80 times [2018-11-12 20:41:48,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:48,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:48,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8162 backedges. 1801 proven. 3358 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-11-12 20:41:49,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:49,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:49,366 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:49,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:49,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:49,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:49,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:49,381 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:49,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-12 20:41:49,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:49,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8162 backedges. 1802 proven. 3240 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-11-12 20:41:49,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8162 backedges. 1802 proven. 3240 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2018-11-12 20:41:51,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:51,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 49 [2018-11-12 20:41:51,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:51,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:41:51,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:41:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=958, Invalid=1394, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:41:51,256 INFO L87 Difference]: Start difference. First operand 419 states and 420 transitions. Second operand 49 states. [2018-11-12 20:41:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:51,843 INFO L93 Difference]: Finished difference Result 429 states and 430 transitions. [2018-11-12 20:41:51,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-12 20:41:51,844 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 416 [2018-11-12 20:41:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:51,846 INFO L225 Difference]: With dead ends: 429 [2018-11-12 20:41:51,846 INFO L226 Difference]: Without dead ends: 427 [2018-11-12 20:41:51,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 790 SyntacticMatches, 83 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=971, Invalid=1579, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:41:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-12 20:41:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-11-12 20:41:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-11-12 20:41:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-11-12 20:41:51,861 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 416 [2018-11-12 20:41:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:51,861 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-11-12 20:41:51,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:41:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-11-12 20:41:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-11-12 20:41:51,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:51,863 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:51,864 INFO L423 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:51,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:51,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1540235067, now seen corresponding path program 81 times [2018-11-12 20:41:51,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:51,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:51,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:51,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:51,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8487 backedges. 3485 proven. 1722 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2018-11-12 20:41:54,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:54,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:54,339 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:54,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:54,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:54,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:54,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:54,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:54,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:54,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:54,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8487 backedges. 3485 proven. 1722 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2018-11-12 20:41:54,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8487 backedges. 3485 proven. 1722 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2018-11-12 20:41:56,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:56,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 87 [2018-11-12 20:41:56,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:56,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-11-12 20:41:56,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-11-12 20:41:56,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:41:56,677 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 87 states. [2018-11-12 20:42:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:00,395 INFO L93 Difference]: Finished difference Result 606 states and 649 transitions. [2018-11-12 20:42:00,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-11-12 20:42:00,396 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 424 [2018-11-12 20:42:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:00,398 INFO L225 Difference]: With dead ends: 606 [2018-11-12 20:42:00,399 INFO L226 Difference]: Without dead ends: 429 [2018-11-12 20:42:00,401 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 765 SyntacticMatches, 84 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6068 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3871, Invalid=12899, Unknown=0, NotChecked=0, Total=16770 [2018-11-12 20:42:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-11-12 20:42:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-11-12 20:42:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-11-12 20:42:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 430 transitions. [2018-11-12 20:42:00,421 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 430 transitions. Word has length 424 [2018-11-12 20:42:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:00,421 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 430 transitions. [2018-11-12 20:42:00,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-11-12 20:42:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 430 transitions. [2018-11-12 20:42:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-11-12 20:42:00,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:00,425 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:00,425 INFO L423 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:00,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:00,425 INFO L82 PathProgramCache]: Analyzing trace with hash 260108469, now seen corresponding path program 82 times [2018-11-12 20:42:00,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:00,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:00,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8571 backedges. 1887 proven. 3524 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-11-12 20:42:01,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:01,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:01,398 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:01,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:01,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:01,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:01,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:01,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:01,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8571 backedges. 1888 proven. 3403 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2018-11-12 20:42:01,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8571 backedges. 1888 proven. 3403 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2018-11-12 20:42:03,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:03,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 50 [2018-11-12 20:42:03,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:03,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-12 20:42:03,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-12 20:42:03,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1002, Invalid=1448, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:42:03,631 INFO L87 Difference]: Start difference. First operand 429 states and 430 transitions. Second operand 50 states. [2018-11-12 20:42:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:04,292 INFO L93 Difference]: Finished difference Result 439 states and 440 transitions. [2018-11-12 20:42:04,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:42:04,292 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 426 [2018-11-12 20:42:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:04,295 INFO L225 Difference]: With dead ends: 439 [2018-11-12 20:42:04,295 INFO L226 Difference]: Without dead ends: 437 [2018-11-12 20:42:04,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 944 GetRequests, 809 SyntacticMatches, 85 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1015, Invalid=1637, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-11-12 20:42:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-11-12 20:42:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-11-12 20:42:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-11-12 20:42:04,313 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 426 [2018-11-12 20:42:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:04,314 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-11-12 20:42:04,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-12 20:42:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-11-12 20:42:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-11-12 20:42:04,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:04,317 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:04,317 INFO L423 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:04,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1432500744, now seen corresponding path program 83 times [2018-11-12 20:42:04,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:04,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:04,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:04,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:04,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-12 20:42:04,482 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:42:04,487 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:42:04,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:42:04 BoogieIcfgContainer [2018-11-12 20:42:04,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:42:04,488 INFO L168 Benchmark]: Toolchain (without parser) took 229790.51 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -702.2 MB). Peak memory consumption was 348.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:42:04,488 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:42:04,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:42:04,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:42:04,489 INFO L168 Benchmark]: Boogie Preprocessor took 34.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:42:04,490 INFO L168 Benchmark]: RCFGBuilder took 530.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:42:04,490 INFO L168 Benchmark]: TraceAbstraction took 228875.74 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 307.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 83.0 MB). Peak memory consumption was 390.7 MB. Max. memory is 7.1 GB. [2018-11-12 20:42:04,493 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 318.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 530.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228875.74 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 307.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 83.0 MB). Peak memory consumption was 390.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 435 with TraceHistMax 43,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. TIMEOUT Result, 228.8s OverallTime, 86 OverallIterations, 43 TraceHistogramMax, 73.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4608 SDtfs, 3742 SDslu, 46891 SDs, 0 SdLazy, 60565 SolverSat, 4438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41877 GetRequests, 34200 SyntacticMatches, 3649 SemanticMatches, 4028 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120215 ImplicationChecksByTransitivity, 150.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 85 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 140.0s InterpolantComputationTime, 36943 NumberOfCodeBlocks, 36943 NumberOfCodeBlocksAsserted, 768 NumberOfCheckSat, 55144 ConstructedInterpolants, 0 QuantifiedInterpolants, 34746008 SizeOfPredicates, 246 NumberOfNonLiveVariables, 39114 ConjunctsInSsa, 3936 ConjunctsInUnsatCore, 249 InterpolantComputations, 3 PerfectInterpolantSequences, 508320/730376 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown