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.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:57:02,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:57:02,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:57:02,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:57:02,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:57:02,146 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:57:02,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:57:02,150 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:57:02,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:57:02,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:57:02,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:57:02,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:57:02,155 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:57:02,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:57:02,157 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:57:02,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:57:02,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:57:02,162 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:57:02,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:57:02,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:57:02,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:57:02,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:57:02,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:57:02,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:57:02,181 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:57:02,182 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:57:02,183 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:57:02,186 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:57:02,187 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:57:02,188 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:57:02,188 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:57:02,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:57:02,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:57:02,191 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:57:02,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:57:02,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:57:02,194 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:57:02,210 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:57:02,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:57:02,211 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:57:02,211 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:57:02,212 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:57:02,213 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:57:02,213 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:57:02,213 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:57:02,213 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:57:02,213 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:57:02,214 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:57:02,214 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:57:02,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:57:02,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:57:02,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:57:02,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:57:02,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:57:02,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:57:02,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:57:02,217 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:57:02,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:57:02,217 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:57:02,217 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:57:02,219 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:57:02,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:57:02,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:57:02,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:57:02,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:57:02,220 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:57:02,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:57:02,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:57:02,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:57:02,221 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:57:02,221 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:57:02,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:57:02,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:57:02,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:57:02,304 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:57:02,305 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:57:02,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i [2018-11-07 04:57:02,362 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01fa5e37f/bceef8785b074b0d9d3f654ef2051016/FLAG2c5d3f876 [2018-11-07 04:57:02,796 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:57:02,797 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i [2018-11-07 04:57:02,804 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01fa5e37f/bceef8785b074b0d9d3f654ef2051016/FLAG2c5d3f876 [2018-11-07 04:57:02,821 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01fa5e37f/bceef8785b074b0d9d3f654ef2051016 [2018-11-07 04:57:02,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:57:02,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:57:02,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:57:02,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:57:02,838 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:57:02,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:57:02" (1/1) ... [2018-11-07 04:57:02,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c053053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:02, skipping insertion in model container [2018-11-07 04:57:02,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:57:02" (1/1) ... [2018-11-07 04:57:02,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:57:02,876 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:57:03,073 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:57:03,077 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:57:03,102 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:57:03,131 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:57:03,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03 WrapperNode [2018-11-07 04:57:03,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:57:03,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:57:03,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:57:03,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:57:03,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... [2018-11-07 04:57:03,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... [2018-11-07 04:57:03,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:57:03,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:57:03,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:57:03,164 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:57:03,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... [2018-11-07 04:57:03,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... [2018-11-07 04:57:03,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... [2018-11-07 04:57:03,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... [2018-11-07 04:57:03,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... [2018-11-07 04:57:03,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... [2018-11-07 04:57:03,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... [2018-11-07 04:57:03,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:57:03,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:57:03,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:57:03,206 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:57:03,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:57:03,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 04:57:03,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:57:03,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:57:03,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 04:57:03,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:57:03,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:57:03,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:57:03,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:57:03,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 04:57:03,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:57:03,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:57:03,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 04:57:03,809 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:57:03,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:57:03 BoogieIcfgContainer [2018-11-07 04:57:03,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:57:03,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:57:03,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:57:03,814 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:57:03,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:57:02" (1/3) ... [2018-11-07 04:57:03,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184bdfc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:57:03, skipping insertion in model container [2018-11-07 04:57:03,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:03" (2/3) ... [2018-11-07 04:57:03,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184bdfc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:57:03, skipping insertion in model container [2018-11-07 04:57:03,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:57:03" (3/3) ... [2018-11-07 04:57:03,818 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call3_true-termination.i [2018-11-07 04:57:03,827 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:57:03,835 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:57:03,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:57:03,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:57:03,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:57:03,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:57:03,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:57:03,889 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:57:03,889 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:57:03,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:57:03,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:57:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-07 04:57:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 04:57:03,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:03,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:03,920 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:03,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1215083166, now seen corresponding path program 1 times [2018-11-07 04:57:03,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:03,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:03,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:03,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:03,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:04,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:57:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:57:04,071 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:57:04,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:57:04,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:57:04,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:57:04,092 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-07 04:57:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:04,113 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-07 04:57:04,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:57:04,115 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 04:57:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:04,124 INFO L225 Difference]: With dead ends: 48 [2018-11-07 04:57:04,125 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 04:57:04,128 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:57:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 04:57:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 04:57:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 04:57:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-07 04:57:04,173 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2018-11-07 04:57:04,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:04,174 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-07 04:57:04,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:57:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-07 04:57:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 04:57:04,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:04,175 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:04,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:04,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1495716299, now seen corresponding path program 1 times [2018-11-07 04:57:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:04,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:04,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:04,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:57:04,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:57:04,281 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:57:04,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:57:04,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:57:04,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:57:04,284 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 3 states. [2018-11-07 04:57:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:04,513 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-07 04:57:04,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:57:04,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 04:57:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:04,517 INFO L225 Difference]: With dead ends: 42 [2018-11-07 04:57:04,517 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 04:57:04,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:57:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 04:57:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-07 04:57:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 04:57:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-07 04:57:04,526 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2018-11-07 04:57:04,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:04,527 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-07 04:57:04,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:57:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-07 04:57:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 04:57:04,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:04,528 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:04,529 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:04,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash 37966098, now seen corresponding path program 1 times [2018-11-07 04:57:04,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:04,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:04,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:04,531 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:04,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:04,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:04,622 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 04:57:04,624 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [27], [28], [31], [43], [46], [48], [54], [55], [56], [58] [2018-11-07 04:57:04,683 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:57:04,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:57:05,071 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 04:57:05,072 INFO L272 AbstractInterpreter]: Visited 20 different actions 62 times. Merged at 5 different actions 35 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-07 04:57:05,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:05,118 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 04:57:05,265 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 74.27% of their original sizes. [2018-11-07 04:57:05,265 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 04:57:05,591 INFO L415 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2018-11-07 04:57:05,591 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 04:57:05,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 04:57:05,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-07 04:57:05,593 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:57:05,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 04:57:05,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 04:57:05,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:57:05,595 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2018-11-07 04:57:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:06,503 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-07 04:57:06,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 04:57:06,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-07 04:57:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:06,504 INFO L225 Difference]: With dead ends: 50 [2018-11-07 04:57:06,504 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 04:57:06,505 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:57:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 04:57:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-11-07 04:57:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 04:57:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-07 04:57:06,518 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2018-11-07 04:57:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:06,519 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-07 04:57:06,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 04:57:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-07 04:57:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 04:57:06,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:06,520 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:06,521 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:06,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2066638414, now seen corresponding path program 1 times [2018-11-07 04:57:06,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:06,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:06,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 04:57:06,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:06,616 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:06,616 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 04:57:06,617 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [17], [19], [23], [27], [28], [31], [33], [35], [43], [46], [48], [54], [55], [56], [58] [2018-11-07 04:57:06,619 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:57:06,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:57:06,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:57:06,837 INFO L272 AbstractInterpreter]: Visited 23 different actions 121 times. Merged at 10 different actions 70 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-07 04:57:06,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:06,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:57:06,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:06,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:06,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:06,880 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:06,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 04:57:06,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 04:57:07,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:07,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 04:57:07,149 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:07,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:57:07,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:57:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 04:57:07,151 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 6 states. [2018-11-07 04:57:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:07,334 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-07 04:57:07,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:57:07,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-07 04:57:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:07,337 INFO L225 Difference]: With dead ends: 64 [2018-11-07 04:57:07,337 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 04:57:07,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 04:57:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 04:57:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2018-11-07 04:57:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 04:57:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-07 04:57:07,346 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2018-11-07 04:57:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:07,346 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-07 04:57:07,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:57:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-07 04:57:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 04:57:07,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:07,348 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:07,348 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:07,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1430451663, now seen corresponding path program 2 times [2018-11-07 04:57:07,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:07,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:07,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 04:57:07,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:07,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:07,492 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:07,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:07,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:07,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:07,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:07,508 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:07,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 04:57:07,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:07,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 04:57:07,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 04:57:08,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:08,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-11-07 04:57:08,003 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:08,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:57:08,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:57:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:57:08,005 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-11-07 04:57:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:08,307 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-07 04:57:08,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:57:08,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-07 04:57:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:08,309 INFO L225 Difference]: With dead ends: 76 [2018-11-07 04:57:08,309 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 04:57:08,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 04:57:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 04:57:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-07 04:57:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 04:57:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-07 04:57:08,320 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 36 [2018-11-07 04:57:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:08,321 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-07 04:57:08,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:57:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-07 04:57:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 04:57:08,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:08,323 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:08,323 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:08,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:08,323 INFO L82 PathProgramCache]: Analyzing trace with hash -384882455, now seen corresponding path program 3 times [2018-11-07 04:57:08,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:08,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:08,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 04:57:08,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:08,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:08,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:08,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:08,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:08,436 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:08,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:08,445 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:08,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:08,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:08,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 04:57:08,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 04:57:08,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:08,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 04:57:08,646 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:08,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:57:08,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:57:08,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:57:08,648 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 8 states. [2018-11-07 04:57:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:08,953 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-11-07 04:57:08,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:57:08,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-07 04:57:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:08,955 INFO L225 Difference]: With dead ends: 93 [2018-11-07 04:57:08,955 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 04:57:08,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:57:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 04:57:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2018-11-07 04:57:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 04:57:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-07 04:57:08,972 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2018-11-07 04:57:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:08,973 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-07 04:57:08,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:57:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-07 04:57:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 04:57:08,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:08,977 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:08,977 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:08,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1720590010, now seen corresponding path program 4 times [2018-11-07 04:57:08,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:08,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:08,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 04:57:09,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:09,150 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:09,151 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:09,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:09,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:09,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:09,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:09,160 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:09,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 04:57:09,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 04:57:09,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:09,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 04:57:09,705 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:09,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:57:09,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:57:09,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:57:09,706 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 9 states. [2018-11-07 04:57:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:09,946 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-07 04:57:09,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:57:09,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-07 04:57:09,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:09,948 INFO L225 Difference]: With dead ends: 103 [2018-11-07 04:57:09,948 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 04:57:09,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:57:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 04:57:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-11-07 04:57:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 04:57:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-07 04:57:09,958 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 58 [2018-11-07 04:57:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:09,959 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-07 04:57:09,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:57:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-07 04:57:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 04:57:09,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:09,961 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:09,961 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:09,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1890900745, now seen corresponding path program 5 times [2018-11-07 04:57:09,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:09,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:09,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:09,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 04:57:10,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:10,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:10,160 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:10,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:10,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:10,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:10,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:10,169 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:10,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 04:57:10,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:10,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 04:57:10,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 04:57:10,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:10,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-11-07 04:57:10,458 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:10,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:57:10,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:57:10,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:57:10,459 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 11 states. [2018-11-07 04:57:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:10,643 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-11-07 04:57:10,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 04:57:10,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-07 04:57:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:10,645 INFO L225 Difference]: With dead ends: 115 [2018-11-07 04:57:10,645 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 04:57:10,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:57:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 04:57:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-11-07 04:57:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 04:57:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-11-07 04:57:10,658 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 63 [2018-11-07 04:57:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:10,658 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-11-07 04:57:10,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:57:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-07 04:57:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 04:57:10,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:10,660 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:10,660 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:10,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:10,661 INFO L82 PathProgramCache]: Analyzing trace with hash -451564995, now seen corresponding path program 6 times [2018-11-07 04:57:10,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:10,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:10,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:10,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 04:57:10,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:10,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:10,822 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:10,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:10,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:10,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:10,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:10,832 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:10,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:10,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:10,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 04:57:10,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 04:57:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 04:57:11,176 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:11,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:57:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:57:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:57:11,178 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 11 states. [2018-11-07 04:57:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:11,354 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-07 04:57:11,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 04:57:11,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-11-07 04:57:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:11,356 INFO L225 Difference]: With dead ends: 132 [2018-11-07 04:57:11,356 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 04:57:11,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:57:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 04:57:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2018-11-07 04:57:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-07 04:57:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-07 04:57:11,370 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2018-11-07 04:57:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:11,371 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-07 04:57:11,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:57:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-07 04:57:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-07 04:57:11,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:11,373 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:11,373 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:11,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1062232128, now seen corresponding path program 7 times [2018-11-07 04:57:11,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:11,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:11,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:11,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:11,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 04:57:11,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:11,538 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:11,538 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:11,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:11,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:11,538 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:11,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:11,548 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:11,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 04:57:11,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 04:57:12,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:12,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 04:57:12,001 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:12,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 04:57:12,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 04:57:12,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:57:12,003 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 12 states. [2018-11-07 04:57:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:12,161 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-07 04:57:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 04:57:12,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-11-07 04:57:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:12,164 INFO L225 Difference]: With dead ends: 142 [2018-11-07 04:57:12,164 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 04:57:12,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:57:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 04:57:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2018-11-07 04:57:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 04:57:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-11-07 04:57:12,179 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 85 [2018-11-07 04:57:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:12,179 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-11-07 04:57:12,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 04:57:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-11-07 04:57:12,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-07 04:57:12,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:12,185 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:12,185 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:12,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:12,190 INFO L82 PathProgramCache]: Analyzing trace with hash 798073885, now seen corresponding path program 8 times [2018-11-07 04:57:12,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:12,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:12,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:12,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:12,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 04:57:12,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:12,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:12,446 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:12,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:12,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:12,447 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:12,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:12,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:12,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 04:57:12,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:12,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 04:57:12,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-07 04:57:12,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:12,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-11-07 04:57:12,845 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:12,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 04:57:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 04:57:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-07 04:57:12,848 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 14 states. [2018-11-07 04:57:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:13,173 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-11-07 04:57:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 04:57:13,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-11-07 04:57:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:13,175 INFO L225 Difference]: With dead ends: 154 [2018-11-07 04:57:13,175 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 04:57:13,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-11-07 04:57:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 04:57:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-11-07 04:57:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 04:57:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-11-07 04:57:13,189 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 90 [2018-11-07 04:57:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:13,189 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-11-07 04:57:13,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 04:57:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-11-07 04:57:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 04:57:13,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:13,191 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:13,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:13,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1763815927, now seen corresponding path program 9 times [2018-11-07 04:57:13,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:13,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:13,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 04:57:13,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:13,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:13,482 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:13,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:13,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:13,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:13,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:13,494 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:13,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:13,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:13,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 04:57:13,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 04:57:14,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:14,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 04:57:14,136 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:14,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 04:57:14,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 04:57:14,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 04:57:14,139 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 14 states. [2018-11-07 04:57:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:14,269 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-11-07 04:57:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 04:57:14,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-07 04:57:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:14,270 INFO L225 Difference]: With dead ends: 171 [2018-11-07 04:57:14,271 INFO L226 Difference]: Without dead ends: 122 [2018-11-07 04:57:14,272 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 04:57:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-07 04:57:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2018-11-07 04:57:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-07 04:57:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-11-07 04:57:14,284 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 107 [2018-11-07 04:57:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:14,284 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-11-07 04:57:14,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 04:57:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-11-07 04:57:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 04:57:14,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:14,286 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:14,286 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:14,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:14,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1559061140, now seen corresponding path program 10 times [2018-11-07 04:57:14,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:14,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:14,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:14,288 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 04:57:14,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:14,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:14,455 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:14,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:14,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:14,456 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:14,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:14,464 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:14,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 04:57:14,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 04:57:15,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:15,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 04:57:15,118 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:15,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 04:57:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 04:57:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 04:57:15,119 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 15 states. [2018-11-07 04:57:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:15,363 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2018-11-07 04:57:15,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 04:57:15,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2018-11-07 04:57:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:15,365 INFO L225 Difference]: With dead ends: 181 [2018-11-07 04:57:15,365 INFO L226 Difference]: Without dead ends: 132 [2018-11-07 04:57:15,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 04:57:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-07 04:57:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2018-11-07 04:57:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-07 04:57:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-11-07 04:57:15,383 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 112 [2018-11-07 04:57:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:15,383 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-11-07 04:57:15,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 04:57:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-11-07 04:57:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 04:57:15,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:15,385 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:15,385 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:15,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:15,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1893239831, now seen corresponding path program 11 times [2018-11-07 04:57:15,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:15,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:15,386 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-07 04:57:16,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:16,184 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:16,184 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:16,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:16,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:16,184 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:16,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:16,193 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:16,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 04:57:16,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:16,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 04:57:16,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-11-07 04:57:16,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:16,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-11-07 04:57:16,735 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:16,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 04:57:16,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 04:57:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2018-11-07 04:57:16,736 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 17 states. [2018-11-07 04:57:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:17,072 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2018-11-07 04:57:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 04:57:17,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 117 [2018-11-07 04:57:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:17,074 INFO L225 Difference]: With dead ends: 193 [2018-11-07 04:57:17,075 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 04:57:17,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2018-11-07 04:57:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 04:57:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-07 04:57:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 04:57:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-11-07 04:57:17,089 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 117 [2018-11-07 04:57:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:17,090 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-11-07 04:57:17,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 04:57:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-11-07 04:57:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 04:57:17,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:17,092 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:17,092 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:17,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:17,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1235713675, now seen corresponding path program 12 times [2018-11-07 04:57:17,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:17,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:17,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:17,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:17,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 04:57:17,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:17,383 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:17,384 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:17,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:17,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:17,384 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:17,392 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:17,393 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:17,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:17,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:17,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 04:57:17,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 04:57:17,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:17,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 04:57:17,924 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:17,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 04:57:17,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 04:57:17,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 04:57:17,926 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 17 states. [2018-11-07 04:57:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:18,096 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2018-11-07 04:57:18,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 04:57:18,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 134 [2018-11-07 04:57:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:18,098 INFO L225 Difference]: With dead ends: 210 [2018-11-07 04:57:18,098 INFO L226 Difference]: Without dead ends: 149 [2018-11-07 04:57:18,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 04:57:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-07 04:57:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2018-11-07 04:57:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-07 04:57:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-11-07 04:57:18,111 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 134 [2018-11-07 04:57:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:18,112 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-11-07 04:57:18,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 04:57:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-11-07 04:57:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 04:57:18,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:18,113 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:18,114 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:18,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:18,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1270918194, now seen corresponding path program 13 times [2018-11-07 04:57:18,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:18,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:18,115 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 04:57:18,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:18,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:18,332 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:18,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:18,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:18,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:18,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:18,340 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:18,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 04:57:18,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 04:57:18,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:18,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 04:57:18,829 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:18,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 04:57:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 04:57:18,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 04:57:18,830 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 18 states. [2018-11-07 04:57:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:19,107 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2018-11-07 04:57:19,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 04:57:19,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2018-11-07 04:57:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:19,109 INFO L225 Difference]: With dead ends: 220 [2018-11-07 04:57:19,109 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 04:57:19,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 04:57:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 04:57:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2018-11-07 04:57:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-07 04:57:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-11-07 04:57:19,120 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 139 [2018-11-07 04:57:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:19,121 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-11-07 04:57:19,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 04:57:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-11-07 04:57:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 04:57:19,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:19,122 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:19,123 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:19,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 983126123, now seen corresponding path program 14 times [2018-11-07 04:57:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:19,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:19,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-11-07 04:57:19,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:19,357 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:19,357 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:19,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:19,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:19,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:19,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:19,366 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:19,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 04:57:19,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:19,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 04:57:19,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-11-07 04:57:20,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:20,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-11-07 04:57:20,473 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:20,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 04:57:20,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 04:57:20,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 04:57:20,475 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 20 states. [2018-11-07 04:57:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:20,760 INFO L93 Difference]: Finished difference Result 232 states and 237 transitions. [2018-11-07 04:57:20,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 04:57:20,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 144 [2018-11-07 04:57:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:20,761 INFO L225 Difference]: With dead ends: 232 [2018-11-07 04:57:20,761 INFO L226 Difference]: Without dead ends: 166 [2018-11-07 04:57:20,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 04:57:20,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-07 04:57:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-11-07 04:57:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 04:57:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-11-07 04:57:20,775 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 144 [2018-11-07 04:57:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:20,776 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-11-07 04:57:20,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 04:57:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-11-07 04:57:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 04:57:20,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:20,777 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:20,777 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:20,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:20,778 INFO L82 PathProgramCache]: Analyzing trace with hash 853731589, now seen corresponding path program 15 times [2018-11-07 04:57:20,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:20,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:20,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:20,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:20,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 04:57:21,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:21,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:21,072 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:21,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:21,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:21,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:21,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:21,081 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:21,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:21,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:21,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 04:57:21,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 04:57:22,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:22,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 04:57:22,179 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:22,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 04:57:22,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 04:57:22,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 04:57:22,181 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 20 states. [2018-11-07 04:57:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:22,377 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-11-07 04:57:22,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 04:57:22,378 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 161 [2018-11-07 04:57:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:22,379 INFO L225 Difference]: With dead ends: 249 [2018-11-07 04:57:22,379 INFO L226 Difference]: Without dead ends: 176 [2018-11-07 04:57:22,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 04:57:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-07 04:57:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2018-11-07 04:57:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 04:57:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-11-07 04:57:22,397 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 161 [2018-11-07 04:57:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:22,398 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-11-07 04:57:22,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 04:57:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-11-07 04:57:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 04:57:22,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:22,399 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:22,400 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:22,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash -742202910, now seen corresponding path program 16 times [2018-11-07 04:57:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:22,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:22,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 04:57:23,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:23,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:23,496 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:23,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:23,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:23,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:23,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:23,507 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:23,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 04:57:23,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 04:57:24,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:24,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 04:57:24,075 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:24,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 04:57:24,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 04:57:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 04:57:24,077 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 21 states. [2018-11-07 04:57:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:24,404 INFO L93 Difference]: Finished difference Result 259 states and 263 transitions. [2018-11-07 04:57:24,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 04:57:24,404 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 166 [2018-11-07 04:57:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:24,406 INFO L225 Difference]: With dead ends: 259 [2018-11-07 04:57:24,406 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 04:57:24,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 04:57:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 04:57:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-11-07 04:57:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-07 04:57:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-11-07 04:57:24,420 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 166 [2018-11-07 04:57:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:24,420 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-11-07 04:57:24,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 04:57:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-11-07 04:57:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-07 04:57:24,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:24,421 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:24,421 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:24,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1858278619, now seen corresponding path program 17 times [2018-11-07 04:57:24,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:24,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:24,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:24,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:24,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-07 04:57:24,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:24,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:24,731 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:24,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:24,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:24,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:24,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:24,743 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:25,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 04:57:25,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:25,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 04:57:25,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-07 04:57:25,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:25,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-11-07 04:57:25,585 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:25,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 04:57:25,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 04:57:25,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 04:57:25,587 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 23 states. [2018-11-07 04:57:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:25,842 INFO L93 Difference]: Finished difference Result 271 states and 276 transitions. [2018-11-07 04:57:25,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 04:57:25,843 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 171 [2018-11-07 04:57:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:25,844 INFO L225 Difference]: With dead ends: 271 [2018-11-07 04:57:25,844 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 04:57:25,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 04:57:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 04:57:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-11-07 04:57:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 04:57:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-11-07 04:57:25,860 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 171 [2018-11-07 04:57:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:25,860 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-11-07 04:57:25,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 04:57:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-11-07 04:57:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 04:57:25,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:25,861 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:25,861 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:25,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash 70537433, now seen corresponding path program 18 times [2018-11-07 04:57:25,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:25,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:25,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:25,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 04:57:26,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:26,401 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:26,401 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:26,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:26,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:26,401 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:26,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:26,411 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:26,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:26,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:26,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 04:57:26,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 04:57:27,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:27,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 04:57:27,161 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:27,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 04:57:27,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 04:57:27,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 04:57:27,163 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 23 states. [2018-11-07 04:57:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:27,445 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2018-11-07 04:57:27,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 04:57:27,445 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 188 [2018-11-07 04:57:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:27,447 INFO L225 Difference]: With dead ends: 288 [2018-11-07 04:57:27,447 INFO L226 Difference]: Without dead ends: 203 [2018-11-07 04:57:27,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 04:57:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-07 04:57:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 194. [2018-11-07 04:57:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 04:57:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-11-07 04:57:27,465 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 188 [2018-11-07 04:57:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:27,465 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-11-07 04:57:27,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 04:57:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-11-07 04:57:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-07 04:57:27,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:27,466 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:27,467 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:27,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:27,467 INFO L82 PathProgramCache]: Analyzing trace with hash 864859612, now seen corresponding path program 19 times [2018-11-07 04:57:27,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:27,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:27,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:27,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:27,468 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 04:57:27,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:27,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:27,889 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:27,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:27,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:27,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:27,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:27,900 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:27,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 04:57:28,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 04:57:28,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:28,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 04:57:28,608 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:28,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 04:57:28,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 04:57:28,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 04:57:28,610 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 24 states. [2018-11-07 04:57:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:29,477 INFO L93 Difference]: Finished difference Result 298 states and 302 transitions. [2018-11-07 04:57:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 04:57:29,478 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 193 [2018-11-07 04:57:29,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:29,480 INFO L225 Difference]: With dead ends: 298 [2018-11-07 04:57:29,480 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 04:57:29,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 04:57:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 04:57:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2018-11-07 04:57:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 04:57:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-11-07 04:57:29,494 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 193 [2018-11-07 04:57:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:29,494 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-11-07 04:57:29,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 04:57:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-11-07 04:57:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 04:57:29,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:29,495 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:29,495 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:29,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:29,496 INFO L82 PathProgramCache]: Analyzing trace with hash 969538233, now seen corresponding path program 20 times [2018-11-07 04:57:29,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:29,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:29,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:29,497 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-11-07 04:57:30,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:30,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:30,395 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:30,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:30,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:30,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:30,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:30,403 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:30,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-11-07 04:57:30,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:30,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 04:57:31,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-11-07 04:57:32,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:32,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 49 [2018-11-07 04:57:32,241 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:32,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 04:57:32,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 04:57:32,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 04:57:32,243 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 27 states. [2018-11-07 04:57:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:32,541 INFO L93 Difference]: Finished difference Result 310 states and 315 transitions. [2018-11-07 04:57:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 04:57:32,541 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 198 [2018-11-07 04:57:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:32,543 INFO L225 Difference]: With dead ends: 310 [2018-11-07 04:57:32,543 INFO L226 Difference]: Without dead ends: 220 [2018-11-07 04:57:32,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 04:57:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-07 04:57:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2018-11-07 04:57:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-07 04:57:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-11-07 04:57:32,561 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 198 [2018-11-07 04:57:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:32,561 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-11-07 04:57:32,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 04:57:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-11-07 04:57:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 04:57:32,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:32,563 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:32,563 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:32,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1495347693, now seen corresponding path program 21 times [2018-11-07 04:57:32,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:32,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:32,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:32,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 04:57:32,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:32,939 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:32,940 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:32,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:32,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:32,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:32,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:32,948 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:33,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:33,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:33,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 04:57:33,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 04:57:34,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:34,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 04:57:34,470 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:34,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 04:57:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 04:57:34,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 04:57:34,472 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 26 states. [2018-11-07 04:57:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:34,774 INFO L93 Difference]: Finished difference Result 327 states and 330 transitions. [2018-11-07 04:57:34,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 04:57:34,775 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2018-11-07 04:57:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:34,777 INFO L225 Difference]: With dead ends: 327 [2018-11-07 04:57:34,777 INFO L226 Difference]: Without dead ends: 230 [2018-11-07 04:57:34,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 04:57:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-07 04:57:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2018-11-07 04:57:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-07 04:57:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-11-07 04:57:34,799 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 215 [2018-11-07 04:57:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:34,799 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-11-07 04:57:34,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 04:57:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-11-07 04:57:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-07 04:57:34,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:34,801 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:34,801 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:34,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash -354263248, now seen corresponding path program 22 times [2018-11-07 04:57:34,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:34,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:34,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:34,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:34,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 04:57:35,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:35,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:35,699 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:35,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:35,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:35,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:35,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:35,709 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:35,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 04:57:35,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 04:57:36,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:36,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 04:57:36,604 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:36,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 04:57:36,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 04:57:36,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 04:57:36,606 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 27 states. [2018-11-07 04:57:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:37,184 INFO L93 Difference]: Finished difference Result 337 states and 341 transitions. [2018-11-07 04:57:37,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 04:57:37,184 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 220 [2018-11-07 04:57:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:37,186 INFO L225 Difference]: With dead ends: 337 [2018-11-07 04:57:37,186 INFO L226 Difference]: Without dead ends: 240 [2018-11-07 04:57:37,190 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 04:57:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-07 04:57:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 226. [2018-11-07 04:57:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-07 04:57:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-11-07 04:57:37,204 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 220 [2018-11-07 04:57:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:37,205 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-11-07 04:57:37,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 04:57:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-11-07 04:57:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 04:57:37,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:37,207 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:37,207 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:37,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1357772851, now seen corresponding path program 23 times [2018-11-07 04:57:37,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:37,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:37,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-11-07 04:57:38,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:38,460 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:38,460 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:38,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:38,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:38,461 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:38,470 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:40,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-07 04:57:40,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:40,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 04:57:40,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-11-07 04:57:41,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:41,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-11-07 04:57:41,085 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:41,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 04:57:41,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 04:57:41,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 04:57:41,088 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 29 states. [2018-11-07 04:57:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:41,392 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2018-11-07 04:57:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 04:57:41,392 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 225 [2018-11-07 04:57:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:41,394 INFO L225 Difference]: With dead ends: 349 [2018-11-07 04:57:41,394 INFO L226 Difference]: Without dead ends: 247 [2018-11-07 04:57:41,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 04:57:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-07 04:57:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2018-11-07 04:57:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-07 04:57:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-11-07 04:57:41,414 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 225 [2018-11-07 04:57:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:41,415 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-11-07 04:57:41,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 04:57:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-11-07 04:57:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-07 04:57:41,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:41,416 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:41,416 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:41,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:41,416 INFO L82 PathProgramCache]: Analyzing trace with hash -886300377, now seen corresponding path program 24 times [2018-11-07 04:57:41,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:41,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:41,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:41,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:41,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 04:57:42,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:42,516 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:42,516 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:42,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:42,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:42,516 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:42,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:42,528 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:43,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:43,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:43,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 04:57:44,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 04:57:45,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:45,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 04:57:45,208 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:45,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 04:57:45,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 04:57:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 04:57:45,211 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 29 states. [2018-11-07 04:57:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:45,692 INFO L93 Difference]: Finished difference Result 366 states and 369 transitions. [2018-11-07 04:57:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 04:57:45,693 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 242 [2018-11-07 04:57:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:45,694 INFO L225 Difference]: With dead ends: 366 [2018-11-07 04:57:45,694 INFO L226 Difference]: Without dead ends: 257 [2018-11-07 04:57:45,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 04:57:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-07 04:57:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 248. [2018-11-07 04:57:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-07 04:57:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2018-11-07 04:57:45,719 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 242 [2018-11-07 04:57:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:45,719 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2018-11-07 04:57:45,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 04:57:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2018-11-07 04:57:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-07 04:57:45,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:45,721 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:45,721 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:45,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash -903625238, now seen corresponding path program 25 times [2018-11-07 04:57:45,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:45,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:45,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:45,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:45,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 04:57:47,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:47,057 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:47,057 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:47,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:47,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:47,058 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:47,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:47,068 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:47,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 04:57:47,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2952 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 04:57:48,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:48,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 04:57:48,245 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:48,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 04:57:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 04:57:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 04:57:48,247 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 30 states. [2018-11-07 04:57:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:48,550 INFO L93 Difference]: Finished difference Result 376 states and 380 transitions. [2018-11-07 04:57:48,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 04:57:48,551 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 247 [2018-11-07 04:57:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:48,552 INFO L225 Difference]: With dead ends: 376 [2018-11-07 04:57:48,552 INFO L226 Difference]: Without dead ends: 267 [2018-11-07 04:57:48,553 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 04:57:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-07 04:57:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2018-11-07 04:57:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-07 04:57:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-11-07 04:57:48,576 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 247 [2018-11-07 04:57:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:48,577 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-11-07 04:57:48,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 04:57:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-11-07 04:57:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-07 04:57:48,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:48,579 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:48,579 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:48,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1257004281, now seen corresponding path program 26 times [2018-11-07 04:57:48,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:48,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:48,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:48,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:48,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-07 04:57:49,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:49,022 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:49,022 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:49,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:49,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:49,022 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:49,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:49,030 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:50,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-07 04:57:50,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:50,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 04:57:50,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-11-07 04:57:51,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:51,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-11-07 04:57:51,451 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:51,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 04:57:51,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 04:57:51,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 04:57:51,453 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 32 states. [2018-11-07 04:57:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:51,885 INFO L93 Difference]: Finished difference Result 388 states and 393 transitions. [2018-11-07 04:57:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 04:57:51,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 252 [2018-11-07 04:57:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:51,887 INFO L225 Difference]: With dead ends: 388 [2018-11-07 04:57:51,887 INFO L226 Difference]: Without dead ends: 274 [2018-11-07 04:57:51,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:57:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-07 04:57:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2018-11-07 04:57:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-07 04:57:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2018-11-07 04:57:51,917 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 252 [2018-11-07 04:57:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:51,917 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2018-11-07 04:57:51,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 04:57:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2018-11-07 04:57:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 04:57:51,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:51,919 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:51,920 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:51,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1121885919, now seen corresponding path program 27 times [2018-11-07 04:57:51,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:51,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:51,921 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 04:57:52,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:52,853 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:52,853 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:52,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:52,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:52,853 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:52,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:52,863 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:54,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:54,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:54,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 04:57:54,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 04:57:55,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 04:57:55,330 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:55,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 04:57:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 04:57:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:57:55,331 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 32 states. [2018-11-07 04:57:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:55,715 INFO L93 Difference]: Finished difference Result 405 states and 408 transitions. [2018-11-07 04:57:55,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 04:57:55,715 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 269 [2018-11-07 04:57:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:55,717 INFO L225 Difference]: With dead ends: 405 [2018-11-07 04:57:55,717 INFO L226 Difference]: Without dead ends: 284 [2018-11-07 04:57:55,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:57:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-07 04:57:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 275. [2018-11-07 04:57:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-07 04:57:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-11-07 04:57:55,746 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 269 [2018-11-07 04:57:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:55,746 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-11-07 04:57:55,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 04:57:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-11-07 04:57:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-07 04:57:55,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:55,748 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:55,748 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:55,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:55,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1941691006, now seen corresponding path program 28 times [2018-11-07 04:57:55,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:55,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:55,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:55,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:55,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 04:57:56,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:56,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:56,492 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:56,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:56,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:56,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:56,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:56,502 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:56,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 04:57:56,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 04:57:57,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:57,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 04:57:57,744 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:57,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 04:57:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 04:57:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 04:57:57,745 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 33 states. [2018-11-07 04:57:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:58,105 INFO L93 Difference]: Finished difference Result 415 states and 419 transitions. [2018-11-07 04:57:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 04:57:58,106 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 274 [2018-11-07 04:57:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:58,107 INFO L225 Difference]: With dead ends: 415 [2018-11-07 04:57:58,107 INFO L226 Difference]: Without dead ends: 294 [2018-11-07 04:57:58,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 04:57:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-07 04:57:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2018-11-07 04:57:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-07 04:57:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-11-07 04:57:58,136 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 274 [2018-11-07 04:57:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:58,136 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-11-07 04:57:58,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 04:57:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-11-07 04:57:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-07 04:57:58,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:58,138 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:58,139 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:58,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:58,139 INFO L82 PathProgramCache]: Analyzing trace with hash -428362943, now seen corresponding path program 29 times [2018-11-07 04:57:58,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:58,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:58,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-11-07 04:57:58,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:58,796 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:58,796 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:58,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:58,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:58,796 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:58,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:58,804 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:58:02,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-07 04:58:02,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:02,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 04:58:02,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3831 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-11-07 04:58:03,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:03,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-11-07 04:58:03,559 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:03,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 04:58:03,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 04:58:03,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 04:58:03,561 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 35 states. [2018-11-07 04:58:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:03,932 INFO L93 Difference]: Finished difference Result 427 states and 432 transitions. [2018-11-07 04:58:03,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 04:58:03,932 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 279 [2018-11-07 04:58:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:03,934 INFO L225 Difference]: With dead ends: 427 [2018-11-07 04:58:03,935 INFO L226 Difference]: Without dead ends: 301 [2018-11-07 04:58:03,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 04:58:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-07 04:58:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-11-07 04:58:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-07 04:58:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-11-07 04:58:03,967 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 279 [2018-11-07 04:58:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:03,967 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-11-07 04:58:03,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 04:58:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-11-07 04:58:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 04:58:03,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:03,970 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:03,970 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:03,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1501491061, now seen corresponding path program 30 times [2018-11-07 04:58:03,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:03,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:03,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 04:58:04,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:04,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:04,945 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:04,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:04,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:04,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:04,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:58:04,953 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:58:07,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:58:07,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:07,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 04:58:07,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4340 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 04:58:08,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:08,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 04:58:08,675 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:08,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 04:58:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 04:58:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 04:58:08,676 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 35 states. [2018-11-07 04:58:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:09,076 INFO L93 Difference]: Finished difference Result 444 states and 447 transitions. [2018-11-07 04:58:09,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 04:58:09,077 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 296 [2018-11-07 04:58:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:09,079 INFO L225 Difference]: With dead ends: 444 [2018-11-07 04:58:09,079 INFO L226 Difference]: Without dead ends: 311 [2018-11-07 04:58:09,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 04:58:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-07 04:58:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 302. [2018-11-07 04:58:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-11-07 04:58:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 303 transitions. [2018-11-07 04:58:09,112 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 303 transitions. Word has length 296 [2018-11-07 04:58:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:09,113 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 303 transitions. [2018-11-07 04:58:09,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 04:58:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 303 transitions. [2018-11-07 04:58:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-11-07 04:58:09,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:09,115 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:09,115 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:09,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1693416456, now seen corresponding path program 31 times [2018-11-07 04:58:09,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:09,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:09,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:09,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 04:58:09,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:09,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:09,786 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:09,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:09,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:09,787 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:09,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:09,796 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:58:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:09,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 04:58:09,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 04:58:11,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:11,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-07 04:58:11,486 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:11,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 04:58:11,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 04:58:11,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 04:58:11,489 INFO L87 Difference]: Start difference. First operand 302 states and 303 transitions. Second operand 36 states. [2018-11-07 04:58:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:13,257 INFO L93 Difference]: Finished difference Result 454 states and 458 transitions. [2018-11-07 04:58:13,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 04:58:13,257 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 301 [2018-11-07 04:58:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:13,259 INFO L225 Difference]: With dead ends: 454 [2018-11-07 04:58:13,259 INFO L226 Difference]: Without dead ends: 321 [2018-11-07 04:58:13,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 04:58:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-07 04:58:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 307. [2018-11-07 04:58:13,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-07 04:58:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-11-07 04:58:13,293 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 301 [2018-11-07 04:58:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:13,293 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-11-07 04:58:13,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 04:58:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-11-07 04:58:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-07 04:58:13,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:13,296 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:13,296 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:13,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:13,296 INFO L82 PathProgramCache]: Analyzing trace with hash 417745237, now seen corresponding path program 32 times [2018-11-07 04:58:13,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:13,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:13,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:13,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:13,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-07 04:58:13,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:13,911 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:13,911 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:13,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:13,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:13,911 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:13,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:58:13,919 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:58:16,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-07 04:58:16,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:16,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 04:58:16,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4659 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-11-07 04:58:18,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:18,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 72 [2018-11-07 04:58:18,077 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:18,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 04:58:18,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 04:58:18,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2288, Invalid=2824, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 04:58:18,079 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 38 states. [2018-11-07 04:58:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:18,538 INFO L93 Difference]: Finished difference Result 466 states and 471 transitions. [2018-11-07 04:58:18,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 04:58:18,538 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 306 [2018-11-07 04:58:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:18,540 INFO L225 Difference]: With dead ends: 466 [2018-11-07 04:58:18,540 INFO L226 Difference]: Without dead ends: 328 [2018-11-07 04:58:18,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2294, Invalid=2962, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 04:58:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-07 04:58:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2018-11-07 04:58:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-07 04:58:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 325 transitions. [2018-11-07 04:58:18,576 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 325 transitions. Word has length 306 [2018-11-07 04:58:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:18,577 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 325 transitions. [2018-11-07 04:58:18,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 04:58:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 325 transitions. [2018-11-07 04:58:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-07 04:58:18,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:18,579 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:18,579 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:18,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:18,580 INFO L82 PathProgramCache]: Analyzing trace with hash -449404369, now seen corresponding path program 33 times [2018-11-07 04:58:18,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:18,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:18,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:18,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:18,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 04:58:19,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:19,375 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:19,375 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:19,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:19,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:19,375 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:19,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:58:19,384 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:58:27,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:58:27,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:27,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 04:58:27,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5219 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 04:58:30,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:30,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-07 04:58:30,237 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:30,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 04:58:30,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 04:58:30,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 04:58:30,238 INFO L87 Difference]: Start difference. First operand 324 states and 325 transitions. Second operand 38 states. [2018-11-07 04:58:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:30,746 INFO L93 Difference]: Finished difference Result 483 states and 486 transitions. [2018-11-07 04:58:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 04:58:30,747 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 323 [2018-11-07 04:58:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:30,748 INFO L225 Difference]: With dead ends: 483 [2018-11-07 04:58:30,749 INFO L226 Difference]: Without dead ends: 338 [2018-11-07 04:58:30,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 04:58:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-07 04:58:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 329. [2018-11-07 04:58:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-07 04:58:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-11-07 04:58:30,783 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 323 [2018-11-07 04:58:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:30,783 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-11-07 04:58:30,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 04:58:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-11-07 04:58:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-07 04:58:30,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:30,785 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:30,786 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:30,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1145000908, now seen corresponding path program 34 times [2018-11-07 04:58:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:30,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:30,787 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 04:58:31,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:31,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:31,661 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:31,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:31,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:31,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:31,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:31,669 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:58:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:31,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 04:58:31,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5391 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 04:58:33,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:33,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-07 04:58:33,252 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:33,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 04:58:33,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 04:58:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 04:58:33,254 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 39 states. [2018-11-07 04:58:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:33,773 INFO L93 Difference]: Finished difference Result 493 states and 497 transitions. [2018-11-07 04:58:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 04:58:33,773 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 328 [2018-11-07 04:58:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:33,775 INFO L225 Difference]: With dead ends: 493 [2018-11-07 04:58:33,775 INFO L226 Difference]: Without dead ends: 348 [2018-11-07 04:58:33,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 04:58:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-07 04:58:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 334. [2018-11-07 04:58:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-07 04:58:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2018-11-07 04:58:33,810 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 328 [2018-11-07 04:58:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:33,810 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2018-11-07 04:58:33,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 04:58:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2018-11-07 04:58:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-07 04:58:33,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:33,813 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:33,813 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:33,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash 535174223, now seen corresponding path program 35 times [2018-11-07 04:58:33,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:33,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:33,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:33,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:33,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-11-07 04:58:34,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:34,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:34,682 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:34,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:34,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:34,683 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:34,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:58:34,691 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:58:41,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-07 04:58:41,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:41,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 04:58:41,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-11-07 04:58:43,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:43,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 79 [2018-11-07 04:58:43,306 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:43,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 04:58:43,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 04:58:43,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2785, Invalid=3377, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 04:58:43,308 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 42 states. [2018-11-07 04:58:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:43,830 INFO L93 Difference]: Finished difference Result 505 states and 510 transitions. [2018-11-07 04:58:43,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 04:58:43,831 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 333 [2018-11-07 04:58:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:43,832 INFO L225 Difference]: With dead ends: 505 [2018-11-07 04:58:43,832 INFO L226 Difference]: Without dead ends: 355 [2018-11-07 04:58:43,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2791, Invalid=3529, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 04:58:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-07 04:58:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-11-07 04:58:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-07 04:58:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-11-07 04:58:43,871 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 333 [2018-11-07 04:58:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:43,871 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-11-07 04:58:43,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 04:58:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-11-07 04:58:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-07 04:58:43,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:43,874 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:43,874 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:43,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1902330941, now seen corresponding path program 36 times [2018-11-07 04:58:43,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:43,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:43,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 04:58:44,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:44,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:44,714 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:44,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:44,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:44,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:44,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:58:44,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:58:56,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:58:56,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:56,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 04:58:56,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6179 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 04:58:58,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:58,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-07 04:58:58,968 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:58,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 04:58:58,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 04:58:58,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 04:58:58,970 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 41 states. [2018-11-07 04:58:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:59,506 INFO L93 Difference]: Finished difference Result 522 states and 525 transitions. [2018-11-07 04:58:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 04:58:59,506 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 350 [2018-11-07 04:58:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:59,508 INFO L225 Difference]: With dead ends: 522 [2018-11-07 04:58:59,508 INFO L226 Difference]: Without dead ends: 365 [2018-11-07 04:58:59,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 04:58:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-11-07 04:58:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 356. [2018-11-07 04:58:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-07 04:58:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 357 transitions. [2018-11-07 04:58:59,548 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 357 transitions. Word has length 350 [2018-11-07 04:58:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:59,549 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 357 transitions. [2018-11-07 04:58:59,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 04:58:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 357 transitions. [2018-11-07 04:58:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-11-07 04:58:59,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:59,551 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:59,552 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:59,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1088352262, now seen corresponding path program 37 times [2018-11-07 04:58:59,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:59,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:59,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 04:59:00,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:00,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:00,564 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:00,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:00,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:00,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:00,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:00,574 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:00,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 04:59:00,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6366 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 04:59:02,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:02,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-07 04:59:02,580 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:02,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 04:59:02,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 04:59:02,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 04:59:02,581 INFO L87 Difference]: Start difference. First operand 356 states and 357 transitions. Second operand 42 states. [2018-11-07 04:59:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:03,168 INFO L93 Difference]: Finished difference Result 532 states and 536 transitions. [2018-11-07 04:59:03,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 04:59:03,169 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 355 [2018-11-07 04:59:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:03,170 INFO L225 Difference]: With dead ends: 532 [2018-11-07 04:59:03,171 INFO L226 Difference]: Without dead ends: 375 [2018-11-07 04:59:03,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 04:59:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-07 04:59:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 361. [2018-11-07 04:59:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-07 04:59:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-11-07 04:59:03,210 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 355 [2018-11-07 04:59:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:03,210 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-11-07 04:59:03,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 04:59:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-11-07 04:59:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-11-07 04:59:03,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:03,212 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:03,213 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:03,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:03,213 INFO L82 PathProgramCache]: Analyzing trace with hash -701370973, now seen corresponding path program 38 times [2018-11-07 04:59:03,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:03,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:03,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:03,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:03,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-11-07 04:59:04,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:04,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:04,067 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:04,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:04,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:04,067 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:04,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:04,075 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:19,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-07 04:59:19,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:19,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 04:59:19,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6558 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-11-07 04:59:21,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:21,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 85 [2018-11-07 04:59:21,015 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:21,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 04:59:21,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 04:59:21,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=3890, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 04:59:21,017 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 45 states. [2018-11-07 04:59:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:21,583 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2018-11-07 04:59:21,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 04:59:21,583 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 360 [2018-11-07 04:59:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:21,584 INFO L225 Difference]: With dead ends: 544 [2018-11-07 04:59:21,585 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 04:59:21,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3256, Invalid=4054, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 04:59:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 04:59:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2018-11-07 04:59:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-11-07 04:59:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2018-11-07 04:59:21,634 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 360 [2018-11-07 04:59:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:21,635 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2018-11-07 04:59:21,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 04:59:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2018-11-07 04:59:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-07 04:59:21,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:21,638 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:21,638 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:21,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:21,638 INFO L82 PathProgramCache]: Analyzing trace with hash -433417923, now seen corresponding path program 39 times [2018-11-07 04:59:21,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:21,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:21,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 04:59:22,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:22,947 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:22,947 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:22,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:22,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:22,948 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:22,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:22,956 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:35,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:35,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:35,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 04:59:35,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 04:59:36,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:36,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-07 04:59:36,989 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:36,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 04:59:36,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 04:59:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 04:59:36,990 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 44 states. [2018-11-07 04:59:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:37,617 INFO L93 Difference]: Finished difference Result 561 states and 564 transitions. [2018-11-07 04:59:37,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 04:59:37,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 377 [2018-11-07 04:59:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:37,619 INFO L225 Difference]: With dead ends: 561 [2018-11-07 04:59:37,619 INFO L226 Difference]: Without dead ends: 392 [2018-11-07 04:59:37,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 04:59:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-11-07 04:59:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 383. [2018-11-07 04:59:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-07 04:59:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-11-07 04:59:37,651 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 377 [2018-11-07 04:59:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:37,652 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-11-07 04:59:37,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 04:59:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-11-07 04:59:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-07 04:59:37,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:37,654 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:37,654 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:37,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:37,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1457310490, now seen corresponding path program 40 times [2018-11-07 04:59:37,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:37,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:37,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:37,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:37,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 04:59:38,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:38,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:38,850 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:38,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:38,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:38,851 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:38,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:38,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:38,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 04:59:39,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7422 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 04:59:41,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:41,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-07 04:59:41,071 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:41,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 04:59:41,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 04:59:41,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 04:59:41,072 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 45 states. [2018-11-07 04:59:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:41,646 INFO L93 Difference]: Finished difference Result 571 states and 575 transitions. [2018-11-07 04:59:41,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 04:59:41,646 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 382 [2018-11-07 04:59:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:41,648 INFO L225 Difference]: With dead ends: 571 [2018-11-07 04:59:41,648 INFO L226 Difference]: Without dead ends: 402 [2018-11-07 04:59:41,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 04:59:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-07 04:59:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 388. [2018-11-07 04:59:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-07 04:59:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 389 transitions. [2018-11-07 04:59:41,689 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 389 transitions. Word has length 382 [2018-11-07 04:59:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:41,690 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 389 transitions. [2018-11-07 04:59:41,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 04:59:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 389 transitions. [2018-11-07 04:59:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-11-07 04:59:41,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:41,693 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:41,693 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:41,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1120219997, now seen corresponding path program 41 times [2018-11-07 04:59:41,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:41,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:41,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 04:59:42,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:42,788 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:42,788 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:42,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:42,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:42,788 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:42,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:42,797 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:59,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-07 04:59:59,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:59,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 04:59:59,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7629 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-11-07 05:00:01,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:01,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 91 [2018-11-07 05:00:01,965 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:01,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 05:00:01,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 05:00:01,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4439, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 05:00:01,967 INFO L87 Difference]: Start difference. First operand 388 states and 389 transitions. Second operand 48 states. [2018-11-07 05:00:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:02,553 INFO L93 Difference]: Finished difference Result 583 states and 588 transitions. [2018-11-07 05:00:02,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 05:00:02,553 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 387 [2018-11-07 05:00:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:02,555 INFO L225 Difference]: With dead ends: 583 [2018-11-07 05:00:02,555 INFO L226 Difference]: Without dead ends: 409 [2018-11-07 05:00:02,557 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3757, Invalid=4615, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 05:00:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-07 05:00:02,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 405. [2018-11-07 05:00:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-07 05:00:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-11-07 05:00:02,602 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 387 [2018-11-07 05:00:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:02,603 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-11-07 05:00:02,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 05:00:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-11-07 05:00:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-07 05:00:02,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:02,605 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:02,606 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:02,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1904900591, now seen corresponding path program 42 times [2018-11-07 05:00:02,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:02,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:02,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:02,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:02,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 05:00:04,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:04,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:04,286 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:04,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:04,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:04,287 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:04,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:04,296 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:16,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:16,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:16,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 05:00:16,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8342 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 05:00:18,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:18,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-07 05:00:18,649 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:18,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 05:00:18,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 05:00:18,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 05:00:18,650 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 47 states. [2018-11-07 05:00:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:19,537 INFO L93 Difference]: Finished difference Result 600 states and 603 transitions. [2018-11-07 05:00:19,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 05:00:19,538 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 404 [2018-11-07 05:00:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:19,539 INFO L225 Difference]: With dead ends: 600 [2018-11-07 05:00:19,539 INFO L226 Difference]: Without dead ends: 419 [2018-11-07 05:00:19,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 05:00:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-07 05:00:19,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 410. [2018-11-07 05:00:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-11-07 05:00:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2018-11-07 05:00:19,582 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 404 [2018-11-07 05:00:19,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:19,582 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 411 transitions. [2018-11-07 05:00:19,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 05:00:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 411 transitions. [2018-11-07 05:00:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-07 05:00:19,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:19,584 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:19,585 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:19,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:19,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1382348268, now seen corresponding path program 43 times [2018-11-07 05:00:19,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:19,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:19,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:19,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:19,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 05:00:20,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:20,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:20,629 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:20,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:20,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:20,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:20,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:20,640 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:20,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 05:00:20,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8559 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 05:00:23,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:23,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-11-07 05:00:23,036 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:23,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 05:00:23,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 05:00:23,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 05:00:23,038 INFO L87 Difference]: Start difference. First operand 410 states and 411 transitions. Second operand 48 states. [2018-11-07 05:00:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:23,790 INFO L93 Difference]: Finished difference Result 610 states and 614 transitions. [2018-11-07 05:00:23,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 05:00:23,790 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 409 [2018-11-07 05:00:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:23,792 INFO L225 Difference]: With dead ends: 610 [2018-11-07 05:00:23,792 INFO L226 Difference]: Without dead ends: 429 [2018-11-07 05:00:23,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 05:00:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-11-07 05:00:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 415. [2018-11-07 05:00:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-11-07 05:00:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-11-07 05:00:23,831 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 409 [2018-11-07 05:00:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:23,831 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-11-07 05:00:23,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 05:00:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-11-07 05:00:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-07 05:00:23,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:23,834 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:23,834 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:23,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash -2107207695, now seen corresponding path program 44 times [2018-11-07 05:00:23,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:23,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:23,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:23,836 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8781 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-11-07 05:00:25,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:25,143 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:25,143 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:25,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:25,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:25,143 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:25,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:25,152 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:51,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-11-07 05:00:51,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:51,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8781 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2018-11-07 05:00:51,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8781 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2018-11-07 05:00:54,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:54,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2018-11-07 05:00:54,214 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:54,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 05:00:54,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 05:00:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 05:00:54,216 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 50 states. [2018-11-07 05:00:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:54,920 INFO L93 Difference]: Finished difference Result 622 states and 627 transitions. [2018-11-07 05:00:54,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 05:00:54,920 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 414 [2018-11-07 05:00:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:54,922 INFO L225 Difference]: With dead ends: 622 [2018-11-07 05:00:54,922 INFO L226 Difference]: Without dead ends: 436 [2018-11-07 05:00:54,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 05:00:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-07 05:00:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2018-11-07 05:00:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-11-07 05:00:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2018-11-07 05:00:54,973 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 414 [2018-11-07 05:00:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:54,974 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2018-11-07 05:00:54,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 05:00:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2018-11-07 05:00:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-11-07 05:00:54,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:54,976 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:54,976 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:54,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1098305973, now seen corresponding path program 45 times [2018-11-07 05:00:54,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:54,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:54,977 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 05:00:56,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:56,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:56,012 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:56,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:56,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:56,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:56,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:56,022 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:01:08,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:01:08,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:08,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 05:01:08,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9545 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 05:01:11,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:11,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-11-07 05:01:11,022 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:11,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 05:01:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 05:01:11,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 05:01:11,024 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 50 states. [2018-11-07 05:01:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:11,973 INFO L93 Difference]: Finished difference Result 639 states and 642 transitions. [2018-11-07 05:01:11,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 05:01:11,973 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 431 [2018-11-07 05:01:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:11,975 INFO L225 Difference]: With dead ends: 639 [2018-11-07 05:01:11,975 INFO L226 Difference]: Without dead ends: 446 [2018-11-07 05:01:11,976 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 815 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 05:01:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-07 05:01:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 437. [2018-11-07 05:01:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-11-07 05:01:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-11-07 05:01:12,017 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 431 [2018-11-07 05:01:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:12,017 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-11-07 05:01:12,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 05:01:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-11-07 05:01:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-07 05:01:12,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:12,019 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:12,019 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:12,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash -360431512, now seen corresponding path program 46 times [2018-11-07 05:01:12,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:12,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:12,021 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9777 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 05:01:13,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:13,227 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:13,227 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:13,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:01:13,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:13,227 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:01:13,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:01:13,235 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:01:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:13,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9777 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-11-07 05:01:13,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 05:01:14,836 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 05:01:15,037 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:01:15,038 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 05:01:15,043 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 05:01:15,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:01:15 BoogieIcfgContainer [2018-11-07 05:01:15,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:01:15,044 INFO L168 Benchmark]: Toolchain (without parser) took 252212.12 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 965.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -943.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2018-11-07 05:01:15,046 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:01:15,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:01:15,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:01:15,048 INFO L168 Benchmark]: Boogie Preprocessor took 40.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:01:15,048 INFO L168 Benchmark]: RCFGBuilder took 605.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-07 05:01:15,048 INFO L168 Benchmark]: TraceAbstraction took 251232.81 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 251.7 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -212.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2018-11-07 05:01:15,053 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.16 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. * CACSL2BoogieTranslator took 298.47 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 29.53 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 40.21 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 605.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251232.81 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 251.7 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -212.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 437 with TraceHistMax 48,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. TIMEOUT Result, 251.1s OverallTime, 49 OverallIterations, 48 TraceHistogramMax, 21.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 766 SDtfs, 7959 SDslu, 11299 SDs, 0 SdLazy, 9290 SolverSat, 1588 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 21823 GetRequests, 19482 SyntacticMatches, 0 SemanticMatches, 2341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5967 ImplicationChecksByTransitivity, 75.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9626984126984126 AbsIntWeakeningRatio, 0.5238095238095238 AbsIntAvgWeakeningVarsNumRemoved, 53.523809523809526 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 48 MinimizatonAttempts, 418 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 138.4s SatisfiabilityAnalysisTime, 81.6s InterpolantComputationTime, 20663 NumberOfCodeBlocks, 20513 NumberOfCodeBlocksAsserted, 438 NumberOfCheckSat, 30830 ConstructedInterpolants, 0 QuantifiedInterpolants, 17969214 SizeOfPredicates, 72 NumberOfNonLiveVariables, 18030 ConjunctsInSsa, 1249 ConjunctsInUnsatCore, 138 InterpolantComputations, 2 PerfectInterpolantSequences, 207495/441542 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown