java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:44:28,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:44:28,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:44:28,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:44:28,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:44:28,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:44:28,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:44:28,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:44:28,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:44:28,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:44:28,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:44:28,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:44:28,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:44:28,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:44:28,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:44:28,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:44:28,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:44:28,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:44:28,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:44:28,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:44:28,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:44:28,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:44:28,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:44:28,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:44:28,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:44:28,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:44:28,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:44:28,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:44:28,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:44:28,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:44:28,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:44:28,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:44:28,095 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:44:28,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:44:28,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:44:28,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:44:28,108 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:44:28,138 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:44:28,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:44:28,139 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:44:28,139 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:44:28,139 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:44:28,139 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:44:28,139 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:44:28,140 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:44:28,140 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:44:28,140 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:44:28,141 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:44:28,141 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:44:28,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:44:28,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:44:28,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:44:28,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:44:28,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:44:28,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:44:28,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:44:28,144 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:44:28,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:44:28,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:44:28,145 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:44:28,145 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:44:28,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:44:28,145 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:44:28,146 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:44:28,146 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:44:28,146 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:44:28,146 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:44:28,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:44:28,147 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:44:28,147 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:44:28,147 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:44:28,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:44:28,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:44:28,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:44:28,220 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:44:28,220 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:44:28,221 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i [2018-11-07 16:44:28,282 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a1127e4/30e8cabe8dfa42148fe546770381d19d/FLAG1de9f74b5 [2018-11-07 16:44:28,735 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:44:28,736 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i [2018-11-07 16:44:28,742 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a1127e4/30e8cabe8dfa42148fe546770381d19d/FLAG1de9f74b5 [2018-11-07 16:44:28,759 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a1127e4/30e8cabe8dfa42148fe546770381d19d [2018-11-07 16:44:28,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:44:28,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:44:28,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:44:28,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:44:28,776 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:44:28,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:44:28" (1/1) ... [2018-11-07 16:44:28,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701e293a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:28, skipping insertion in model container [2018-11-07 16:44:28,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:44:28" (1/1) ... [2018-11-07 16:44:28,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:44:28,807 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:44:29,010 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:44:29,014 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:44:29,034 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:44:29,050 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:44:29,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29 WrapperNode [2018-11-07 16:44:29,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:44:29,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:44:29,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:44:29,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:44:29,062 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:44:29" (1/1) ... [2018-11-07 16:44:29,070 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:44:29" (1/1) ... [2018-11-07 16:44:29,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:44:29,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:44:29,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:44:29,078 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:44:29,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29" (1/1) ... [2018-11-07 16:44:29,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29" (1/1) ... [2018-11-07 16:44:29,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29" (1/1) ... [2018-11-07 16:44:29,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29" (1/1) ... [2018-11-07 16:44:29,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29" (1/1) ... [2018-11-07 16:44:29,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29" (1/1) ... [2018-11-07 16:44:29,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29" (1/1) ... [2018-11-07 16:44:29,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:44:29,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:44:29,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:44:29,099 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:44:29,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:44:29,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:44:29,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:44:29,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:44:29,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:44:29,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:44:29,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:44:29,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:44:29,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:44:29,485 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:44:29,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:44:29 BoogieIcfgContainer [2018-11-07 16:44:29,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:44:29,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:44:29,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:44:29,502 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:44:29,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:44:28" (1/3) ... [2018-11-07 16:44:29,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e65960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:44:29, skipping insertion in model container [2018-11-07 16:44:29,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:44:29" (2/3) ... [2018-11-07 16:44:29,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e65960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:44:29, skipping insertion in model container [2018-11-07 16:44:29,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:44:29" (3/3) ... [2018-11-07 16:44:29,509 INFO L112 eAbstractionObserver]: Analyzing ICFG up_true-unreach-call_true-termination.i [2018-11-07 16:44:29,527 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:44:29,535 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:44:29,561 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:44:29,592 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:44:29,592 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:44:29,592 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:44:29,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:44:29,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:44:29,593 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:44:29,593 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:44:29,593 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:44:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-07 16:44:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 16:44:29,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:29,619 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:29,621 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:29,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1884544245, now seen corresponding path program 1 times [2018-11-07 16:44:29,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:29,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:29,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:29,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:29,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:29,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:44:29,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:44:29,734 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:44:29,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:44:29,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:44:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:44:29,753 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-07 16:44:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:29,773 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-07 16:44:29,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:44:29,774 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-07 16:44:29,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:29,783 INFO L225 Difference]: With dead ends: 37 [2018-11-07 16:44:29,783 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 16:44:29,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:44:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 16:44:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 16:44:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 16:44:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-07 16:44:29,821 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-07 16:44:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:29,821 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-07 16:44:29,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:44:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-07 16:44:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 16:44:29,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:29,822 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:29,823 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:29,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1969781111, now seen corresponding path program 1 times [2018-11-07 16:44:29,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:29,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:29,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:29,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:44:29,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:44:29,929 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:44:29,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:44:29,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:44:29,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:44:29,931 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-07 16:44:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:30,059 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-07 16:44:30,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:44:30,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-07 16:44:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:30,060 INFO L225 Difference]: With dead ends: 33 [2018-11-07 16:44:30,061 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 16:44:30,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:44:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 16:44:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 16:44:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 16:44:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-07 16:44:30,068 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-07 16:44:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:30,069 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-07 16:44:30,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:44:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-07 16:44:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 16:44:30,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:30,070 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:30,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:30,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1960344783, now seen corresponding path program 1 times [2018-11-07 16:44:30,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:30,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:30,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:30,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:30,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:44:30,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:44:30,201 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:44:30,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:44:30,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:44:30,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:44:30,202 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-07 16:44:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:30,383 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-07 16:44:30,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:44:30,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 16:44:30,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:30,388 INFO L225 Difference]: With dead ends: 34 [2018-11-07 16:44:30,388 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 16:44:30,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:44:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 16:44:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-07 16:44:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 16:44:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-07 16:44:30,402 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2018-11-07 16:44:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:30,402 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-07 16:44:30,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:44:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-07 16:44:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 16:44:30,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:30,404 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:30,404 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:30,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1864992939, now seen corresponding path program 1 times [2018-11-07 16:44:30,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:30,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:30,407 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:30,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:30,694 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:30,696 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-07 16:44:30,698 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [22], [28], [30], [35], [38], [40], [43], [45], [46], [47], [48], [50], [51] [2018-11-07 16:44:30,730 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:44:30,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:44:31,028 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:44:31,033 INFO L272 AbstractInterpreter]: Visited 19 different actions 115 times. Merged at 8 different actions 48 times. Widened at 3 different actions 6 times. Found 7 fixpoints after 3 different actions. Largest state had 9 variables. [2018-11-07 16:44:31,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:31,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:44:31,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:31,081 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:31,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:31,092 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:31,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:31,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:31,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:31,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2018-11-07 16:44:31,326 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:31,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:44:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:44:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:44:31,328 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-07 16:44:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:31,558 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-07 16:44:31,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:44:31,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-07 16:44:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:31,562 INFO L225 Difference]: With dead ends: 46 [2018-11-07 16:44:31,562 INFO L226 Difference]: Without dead ends: 29 [2018-11-07 16:44:31,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:44:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-07 16:44:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-07 16:44:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-07 16:44:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-07 16:44:31,570 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-11-07 16:44:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:31,570 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-07 16:44:31,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:44:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-07 16:44:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 16:44:31,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:31,571 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:31,572 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:31,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash -62381937, now seen corresponding path program 2 times [2018-11-07 16:44:31,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:31,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:31,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:31,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:31,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:31,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:31,698 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:31,698 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:31,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:31,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:31,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:31,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:31,718 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:31,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:44:31,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:31,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:31,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:32,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:32,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2018-11-07 16:44:32,198 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:32,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:44:32,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:44:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:44:32,199 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2018-11-07 16:44:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:32,356 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-07 16:44:32,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:44:32,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-07 16:44:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:32,359 INFO L225 Difference]: With dead ends: 39 [2018-11-07 16:44:32,360 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 16:44:32,360 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:44:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 16:44:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 16:44:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 16:44:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-07 16:44:32,368 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2018-11-07 16:44:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:32,368 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-07 16:44:32,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:44:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-07 16:44:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 16:44:32,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:32,370 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:32,370 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:32,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1261098675, now seen corresponding path program 3 times [2018-11-07 16:44:32,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:32,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:32,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:32,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:32,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:44:32,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:32,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:32,483 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:32,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:32,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:32,484 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:32,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:32,498 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:32,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:32,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:32,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:44:32,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:44:32,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:32,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2018-11-07 16:44:32,835 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:32,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:44:32,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:44:32,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:44:32,837 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 12 states. [2018-11-07 16:44:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:32,987 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-07 16:44:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:44:32,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-07 16:44:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:32,989 INFO L225 Difference]: With dead ends: 60 [2018-11-07 16:44:32,989 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 16:44:32,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:44:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 16:44:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-07 16:44:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 16:44:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-07 16:44:32,997 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-11-07 16:44:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:32,997 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-07 16:44:32,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:44:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-07 16:44:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 16:44:32,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:32,999 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:32,999 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:32,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1825718419, now seen corresponding path program 4 times [2018-11-07 16:44:33,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:33,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:33,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:33,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:33,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:44:33,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:33,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:33,151 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:33,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:33,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:33,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 16:44:33,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:33,159 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:33,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:44:33,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:44:33,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:33,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2018-11-07 16:44:33,348 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:33,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:44:33,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:44:33,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 16:44:33,349 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-11-07 16:44:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:33,512 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-07 16:44:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:44:33,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-07 16:44:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:33,515 INFO L225 Difference]: With dead ends: 49 [2018-11-07 16:44:33,515 INFO L226 Difference]: Without dead ends: 47 [2018-11-07 16:44:33,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:44:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-07 16:44:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-07 16:44:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 16:44:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-07 16:44:33,523 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2018-11-07 16:44:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:33,523 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-07 16:44:33,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:44:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-07 16:44:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 16:44:33,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:33,525 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:33,525 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:33,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:33,525 INFO L82 PathProgramCache]: Analyzing trace with hash -51726447, now seen corresponding path program 5 times [2018-11-07 16:44:33,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:33,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:33,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:33,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:33,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:44:33,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:33,802 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:33,802 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:33,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:33,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:33,802 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:33,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:33,812 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:33,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 16:44:33,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:33,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:44:33,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:44:34,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:34,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2018-11-07 16:44:34,068 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:34,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:44:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:44:34,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:44:34,069 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 15 states. [2018-11-07 16:44:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:34,393 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-07 16:44:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:44:34,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-07 16:44:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:34,396 INFO L225 Difference]: With dead ends: 74 [2018-11-07 16:44:34,397 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 16:44:34,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:44:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 16:44:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-07 16:44:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 16:44:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-07 16:44:34,405 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2018-11-07 16:44:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:34,406 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-07 16:44:34,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:44:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-07 16:44:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 16:44:34,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:34,407 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:34,408 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:34,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash 446005195, now seen corresponding path program 6 times [2018-11-07 16:44:34,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:34,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:34,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:44:34,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:34,587 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:34,587 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:34,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:34,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:34,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:34,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:34,596 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:34,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:34,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:34,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:44:34,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:44:34,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:34,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2018-11-07 16:44:34,806 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:34,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:44:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:44:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:44:34,808 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 12 states. [2018-11-07 16:44:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:34,952 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-07 16:44:34,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:44:34,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-07 16:44:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:34,955 INFO L225 Difference]: With dead ends: 59 [2018-11-07 16:44:34,955 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 16:44:34,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:44:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 16:44:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-07 16:44:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 16:44:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-07 16:44:34,963 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2018-11-07 16:44:34,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:34,963 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-07 16:44:34,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:44:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-07 16:44:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 16:44:34,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:34,965 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:34,965 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:34,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:34,965 INFO L82 PathProgramCache]: Analyzing trace with hash -239912465, now seen corresponding path program 7 times [2018-11-07 16:44:34,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:34,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:34,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:34,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:34,967 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 16:44:35,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:35,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:35,114 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:35,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:35,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:35,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:35,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:35,124 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:35,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 16:44:35,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 16:44:35,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:35,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2018-11-07 16:44:35,461 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:35,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:44:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:44:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:44:35,463 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 18 states. [2018-11-07 16:44:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:36,041 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-07 16:44:36,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:44:36,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-07 16:44:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:36,042 INFO L225 Difference]: With dead ends: 88 [2018-11-07 16:44:36,042 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 16:44:36,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:44:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 16:44:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-07 16:44:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 16:44:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-07 16:44:36,052 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-11-07 16:44:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:36,053 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-07 16:44:36,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:44:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-07 16:44:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 16:44:36,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:36,054 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:36,054 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:36,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash -363560535, now seen corresponding path program 8 times [2018-11-07 16:44:36,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:36,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:36,056 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 37 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:44:36,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:36,192 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:36,192 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:36,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:36,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:36,193 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:36,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:36,203 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:36,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:44:36,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:36,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 16:44:36,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 16:44:36,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:36,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2018-11-07 16:44:36,542 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:36,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:44:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:44:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:44:36,544 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 13 states. [2018-11-07 16:44:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:36,694 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-11-07 16:44:36,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:44:36,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-11-07 16:44:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:36,696 INFO L225 Difference]: With dead ends: 69 [2018-11-07 16:44:36,697 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 16:44:36,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:44:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 16:44:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-07 16:44:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 16:44:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-11-07 16:44:36,706 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2018-11-07 16:44:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:36,706 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-11-07 16:44:36,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:44:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-07 16:44:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 16:44:36,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:36,708 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:36,708 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:36,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:36,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1782152653, now seen corresponding path program 9 times [2018-11-07 16:44:36,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:36,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:36,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:36,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:44:36,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:36,942 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:36,942 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:36,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:36,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:36,943 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:36,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:36,951 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:36,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:36,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:37,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:44:37,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:44:37,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:37,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2018-11-07 16:44:37,647 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:37,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:44:37,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:44:37,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:44:37,650 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 21 states. [2018-11-07 16:44:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:38,162 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-07 16:44:38,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:44:38,162 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-07 16:44:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:38,163 INFO L225 Difference]: With dead ends: 102 [2018-11-07 16:44:38,164 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 16:44:38,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 111 SyntacticMatches, 12 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:44:38,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 16:44:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-07 16:44:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 16:44:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-07 16:44:38,184 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2018-11-07 16:44:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:38,184 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-07 16:44:38,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:44:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-07 16:44:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 16:44:38,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:38,186 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:38,186 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:38,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1767367943, now seen corresponding path program 10 times [2018-11-07 16:44:38,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:38,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:38,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:38,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 68 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:44:38,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:38,417 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:38,417 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:38,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:38,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:38,417 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:38,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:38,427 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:38,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:44:38,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:44:38,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:38,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2018-11-07 16:44:38,719 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:38,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:44:38,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:44:38,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:44:38,720 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2018-11-07 16:44:38,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:38,983 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-07 16:44:38,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:44:38,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-11-07 16:44:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:38,984 INFO L225 Difference]: With dead ends: 79 [2018-11-07 16:44:38,984 INFO L226 Difference]: Without dead ends: 77 [2018-11-07 16:44:38,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 125 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:44:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-07 16:44:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-07 16:44:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-07 16:44:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-11-07 16:44:38,991 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 66 [2018-11-07 16:44:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:38,992 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-11-07 16:44:38,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:44:38,992 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-11-07 16:44:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 16:44:38,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:38,993 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:38,994 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:38,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:38,994 INFO L82 PathProgramCache]: Analyzing trace with hash 508207915, now seen corresponding path program 11 times [2018-11-07 16:44:38,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:38,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:38,995 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 16:44:39,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:39,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:39,273 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:39,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:39,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:39,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:39,282 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:39,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 16:44:39,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:39,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 16:44:39,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 16:44:40,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:40,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2018-11-07 16:44:40,073 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:40,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:44:40,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:44:40,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:44:40,075 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 24 states. [2018-11-07 16:44:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:40,351 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-07 16:44:40,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:44:40,351 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-07 16:44:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:40,352 INFO L225 Difference]: With dead ends: 116 [2018-11-07 16:44:40,352 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 16:44:40,354 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 128 SyntacticMatches, 14 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:44:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 16:44:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-07 16:44:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 16:44:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-07 16:44:40,361 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-11-07 16:44:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:40,362 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-07 16:44:40,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:44:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-07 16:44:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-07 16:44:40,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:40,363 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:40,364 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:40,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash 262457829, now seen corresponding path program 12 times [2018-11-07 16:44:40,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:40,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:40,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:40,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:40,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 67 proven. 94 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:44:40,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:40,509 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:40,510 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:40,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:40,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:40,510 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:40,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:40,518 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:40,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:40,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:40,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 16:44:40,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 16:44:40,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:40,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2018-11-07 16:44:40,702 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:40,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:44:40,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:44:40,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:44:40,703 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 15 states. [2018-11-07 16:44:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:40,892 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-11-07 16:44:40,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:44:40,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-07 16:44:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:40,895 INFO L225 Difference]: With dead ends: 89 [2018-11-07 16:44:40,895 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 16:44:40,896 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 144 SyntacticMatches, 15 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:44:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 16:44:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-07 16:44:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 16:44:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-11-07 16:44:40,904 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 76 [2018-11-07 16:44:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:40,904 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-11-07 16:44:40,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:44:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-11-07 16:44:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-07 16:44:40,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:40,906 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:40,906 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:40,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1053542921, now seen corresponding path program 13 times [2018-11-07 16:44:40,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:40,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:40,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:40,908 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:44:41,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:41,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:41,098 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:41,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:41,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:41,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:41,111 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:41,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:44:41,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:44:41,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:41,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 27 [2018-11-07 16:44:41,511 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:41,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:44:41,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:44:41,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2018-11-07 16:44:41,512 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 27 states. [2018-11-07 16:44:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:41,850 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-07 16:44:41,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:44:41,854 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-11-07 16:44:41,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:41,855 INFO L225 Difference]: With dead ends: 130 [2018-11-07 16:44:41,855 INFO L226 Difference]: Without dead ends: 89 [2018-11-07 16:44:41,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:44:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-07 16:44:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-07 16:44:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 16:44:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-11-07 16:44:41,863 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2018-11-07 16:44:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:41,863 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-11-07 16:44:41,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:44:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-11-07 16:44:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 16:44:41,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:41,865 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:41,865 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:41,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash -396865469, now seen corresponding path program 14 times [2018-11-07 16:44:41,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:41,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:41,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:41,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:41,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 85 proven. 124 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:44:42,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:42,616 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:42,616 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:42,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:42,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:42,616 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:42,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:42,627 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:42,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:44:42,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:42,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:44:42,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:44:42,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:42,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2018-11-07 16:44:42,893 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:42,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:44:42,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:44:42,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:44:42,894 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 16 states. [2018-11-07 16:44:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:43,075 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-11-07 16:44:43,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:44:43,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-11-07 16:44:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:43,077 INFO L225 Difference]: With dead ends: 99 [2018-11-07 16:44:43,077 INFO L226 Difference]: Without dead ends: 97 [2018-11-07 16:44:43,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 163 SyntacticMatches, 17 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:44:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-07 16:44:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-07 16:44:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-07 16:44:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-11-07 16:44:43,084 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2018-11-07 16:44:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:43,085 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-11-07 16:44:43,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:44:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-11-07 16:44:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-07 16:44:43,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:43,087 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:43,087 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:43,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash -138800537, now seen corresponding path program 15 times [2018-11-07 16:44:43,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:43,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:43,089 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 16:44:43,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:43,474 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:43,474 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:43,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:43,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:43,474 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:43,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:43,483 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:43,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:43,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:43,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 16:44:43,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 16:44:43,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:43,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 30 [2018-11-07 16:44:43,992 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:43,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 16:44:43,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 16:44:43,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:44:43,993 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 30 states. [2018-11-07 16:44:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:44,286 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-07 16:44:44,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:44:44,288 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-11-07 16:44:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:44,289 INFO L225 Difference]: With dead ends: 144 [2018-11-07 16:44:44,289 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 16:44:44,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 162 SyntacticMatches, 18 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:44:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 16:44:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-07 16:44:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 16:44:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-11-07 16:44:44,297 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2018-11-07 16:44:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:44,297 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-11-07 16:44:44,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 16:44:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-11-07 16:44:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-07 16:44:44,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:44,298 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:44,299 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:44,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1817733087, now seen corresponding path program 16 times [2018-11-07 16:44:44,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:44,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:44,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 105 proven. 158 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 16:44:44,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:44,835 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:44,835 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:44,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:44,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:44,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:44,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:44,844 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:44,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 16:44:44,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 16:44:45,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:45,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2018-11-07 16:44:45,053 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:45,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:44:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:44:45,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:44:45,054 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 17 states. [2018-11-07 16:44:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:45,472 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-11-07 16:44:45,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:44:45,473 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-07 16:44:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:45,475 INFO L225 Difference]: With dead ends: 109 [2018-11-07 16:44:45,475 INFO L226 Difference]: Without dead ends: 107 [2018-11-07 16:44:45,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 182 SyntacticMatches, 19 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:44:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-07 16:44:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-07 16:44:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 16:44:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-11-07 16:44:45,481 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2018-11-07 16:44:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:45,482 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-11-07 16:44:45,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:44:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-11-07 16:44:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 16:44:45,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:45,483 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:45,483 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:45,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:45,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1915395141, now seen corresponding path program 17 times [2018-11-07 16:44:45,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:45,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:45,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:45,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:45,485 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:44:45,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:45,765 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:45,765 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:45,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:45,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:45,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:45,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:45,774 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:45,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 16:44:45,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:45,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:44:46,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:44:46,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:46,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 33 [2018-11-07 16:44:46,298 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:46,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 16:44:46,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 16:44:46,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 16:44:46,299 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 33 states. [2018-11-07 16:44:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:47,046 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-11-07 16:44:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:44:47,047 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-11-07 16:44:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:47,048 INFO L225 Difference]: With dead ends: 158 [2018-11-07 16:44:47,048 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 16:44:47,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 179 SyntacticMatches, 20 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=472, Invalid=1420, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:44:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 16:44:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-11-07 16:44:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-07 16:44:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-11-07 16:44:47,057 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2018-11-07 16:44:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:47,057 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-11-07 16:44:47,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 16:44:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-11-07 16:44:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-07 16:44:47,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:47,058 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:47,058 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:47,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:47,059 INFO L82 PathProgramCache]: Analyzing trace with hash -924860033, now seen corresponding path program 18 times [2018-11-07 16:44:47,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:47,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:47,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:47,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 127 proven. 196 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:44:47,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:47,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:47,301 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:47,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:47,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:47,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:47,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:47,310 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:47,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:47,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:47,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:44:47,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 16:44:47,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:47,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2018-11-07 16:44:47,662 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:47,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:44:47,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:44:47,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:44:47,663 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 18 states. [2018-11-07 16:44:47,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:47,866 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-11-07 16:44:47,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:44:47,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 106 [2018-11-07 16:44:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:47,868 INFO L225 Difference]: With dead ends: 119 [2018-11-07 16:44:47,868 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 16:44:47,869 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 21 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:44:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 16:44:47,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-07 16:44:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 16:44:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-11-07 16:44:47,875 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2018-11-07 16:44:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:47,876 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-11-07 16:44:47,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:44:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-11-07 16:44:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-07 16:44:47,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:47,877 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:47,877 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:47,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:47,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1447724963, now seen corresponding path program 19 times [2018-11-07 16:44:47,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:47,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:47,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:47,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:47,879 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 16:44:48,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:48,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:48,806 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:48,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:48,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:48,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:48,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:48,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:48,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 16:44:49,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 16:44:50,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:50,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 36 [2018-11-07 16:44:50,194 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:50,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 16:44:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 16:44:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:44:50,195 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 36 states. [2018-11-07 16:44:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:50,737 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-11-07 16:44:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:44:50,740 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 114 [2018-11-07 16:44:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:50,741 INFO L225 Difference]: With dead ends: 172 [2018-11-07 16:44:50,741 INFO L226 Difference]: Without dead ends: 119 [2018-11-07 16:44:50,743 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 196 SyntacticMatches, 22 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=557, Invalid=1699, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:44:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-07 16:44:50,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-11-07 16:44:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-07 16:44:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-11-07 16:44:50,750 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-11-07 16:44:50,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:50,750 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-11-07 16:44:50,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 16:44:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-11-07 16:44:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 16:44:50,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:50,751 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:50,751 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:50,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:50,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1483074653, now seen corresponding path program 20 times [2018-11-07 16:44:50,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:50,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:50,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:50,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:50,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 151 proven. 238 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 16:44:51,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:51,243 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:51,243 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:51,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:51,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:51,243 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:51,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:51,253 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:51,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 16:44:51,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:51,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 16:44:51,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 16:44:51,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:51,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2018-11-07 16:44:51,633 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:51,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:44:51,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:44:51,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:44:51,634 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 19 states. [2018-11-07 16:44:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:51,827 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-11-07 16:44:51,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:44:51,828 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 116 [2018-11-07 16:44:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:51,830 INFO L225 Difference]: With dead ends: 129 [2018-11-07 16:44:51,830 INFO L226 Difference]: Without dead ends: 127 [2018-11-07 16:44:51,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 220 SyntacticMatches, 23 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:44:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-07 16:44:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-07 16:44:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-07 16:44:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-11-07 16:44:51,836 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2018-11-07 16:44:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:51,837 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-11-07 16:44:51,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:44:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-11-07 16:44:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-07 16:44:51,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:51,838 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:51,838 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:51,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:51,838 INFO L82 PathProgramCache]: Analyzing trace with hash -849415039, now seen corresponding path program 21 times [2018-11-07 16:44:51,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:51,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:51,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:51,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:51,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:44:52,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:52,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:52,249 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:52,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:52,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:52,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:52,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:52,259 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:52,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:52,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:52,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:44:53,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:44:53,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:53,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 39 [2018-11-07 16:44:53,319 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:53,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:44:53,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:44:53,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:44:53,320 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 39 states. [2018-11-07 16:44:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:53,871 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2018-11-07 16:44:53,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 16:44:53,872 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 124 [2018-11-07 16:44:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:53,873 INFO L225 Difference]: With dead ends: 186 [2018-11-07 16:44:53,874 INFO L226 Difference]: Without dead ends: 129 [2018-11-07 16:44:53,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=649, Invalid=2003, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:44:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-07 16:44:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-07 16:44:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-07 16:44:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-11-07 16:44:53,882 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2018-11-07 16:44:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:53,883 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-11-07 16:44:53,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:44:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-11-07 16:44:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 16:44:53,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:53,884 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:53,884 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:53,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:53,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1380501317, now seen corresponding path program 22 times [2018-11-07 16:44:53,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:53,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:53,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:53,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:53,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 177 proven. 284 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 16:44:54,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:54,101 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:54,101 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:54,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:54,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:54,101 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:54,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:54,110 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:54,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 178 proven. 253 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:44:54,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 178 proven. 253 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 16:44:54,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:54,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 20 [2018-11-07 16:44:54,393 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:54,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:44:54,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:44:54,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:44:54,394 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 20 states. [2018-11-07 16:44:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:54,603 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-11-07 16:44:54,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:44:54,604 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 126 [2018-11-07 16:44:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:54,606 INFO L225 Difference]: With dead ends: 139 [2018-11-07 16:44:54,606 INFO L226 Difference]: Without dead ends: 137 [2018-11-07 16:44:54,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 239 SyntacticMatches, 25 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:44:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-07 16:44:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-11-07 16:44:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-07 16:44:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-11-07 16:44:54,614 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2018-11-07 16:44:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:54,614 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-11-07 16:44:54,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:44:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-11-07 16:44:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 16:44:54,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:54,616 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:54,616 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:54,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash 63242975, now seen corresponding path program 23 times [2018-11-07 16:44:54,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:54,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:54,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:54,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:54,617 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 324 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-07 16:44:55,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:55,207 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:55,207 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:55,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:55,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:55,208 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:55,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:55,217 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:44:55,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-07 16:44:55,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:55,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 324 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-07 16:44:55,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 324 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-07 16:44:55,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:55,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 42 [2018-11-07 16:44:55,935 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:55,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 16:44:55,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 16:44:55,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:44:55,937 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 42 states. [2018-11-07 16:44:56,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:56,595 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2018-11-07 16:44:56,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 16:44:56,595 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 134 [2018-11-07 16:44:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:56,597 INFO L225 Difference]: With dead ends: 200 [2018-11-07 16:44:56,597 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 16:44:56,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 230 SyntacticMatches, 26 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=748, Invalid=2332, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 16:44:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 16:44:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-11-07 16:44:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-07 16:44:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-11-07 16:44:56,605 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-11-07 16:44:56,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:56,606 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-11-07 16:44:56,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 16:44:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-11-07 16:44:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 16:44:56,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:56,607 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:56,607 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:56,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash -781662567, now seen corresponding path program 24 times [2018-11-07 16:44:56,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:56,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:56,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 205 proven. 334 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-07 16:44:56,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:56,821 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:56,821 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:56,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 16:44:56,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:56,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:56,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:56,833 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:56,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:56,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:56,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 206 proven. 300 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-07 16:44:56,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 206 proven. 300 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-07 16:44:57,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:57,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 21 [2018-11-07 16:44:57,273 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:57,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:44:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:44:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:44:57,274 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 21 states. [2018-11-07 16:44:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:57,786 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-11-07 16:44:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:44:57,786 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 136 [2018-11-07 16:44:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:57,788 INFO L225 Difference]: With dead ends: 149 [2018-11-07 16:44:57,788 INFO L226 Difference]: Without dead ends: 147 [2018-11-07 16:44:57,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 258 SyntacticMatches, 27 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-11-07 16:44:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-07 16:44:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-11-07 16:44:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 16:44:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-11-07 16:44:57,796 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2018-11-07 16:44:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:57,797 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-11-07 16:44:57,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:44:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-11-07 16:44:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 16:44:57,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:57,798 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:57,799 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:57,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:57,799 INFO L82 PathProgramCache]: Analyzing trace with hash 720491197, now seen corresponding path program 25 times [2018-11-07 16:44:57,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:57,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:57,800 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:44:59,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:59,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:59,241 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:59,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:59,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:59,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:59,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:59,250 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:59,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:44:59,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:45:00,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:00,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 45 [2018-11-07 16:45:00,162 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:00,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 16:45:00,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 16:45:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1501, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:45:00,164 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 45 states. [2018-11-07 16:45:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:02,225 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-11-07 16:45:02,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:45:02,226 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 144 [2018-11-07 16:45:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:02,227 INFO L225 Difference]: With dead ends: 214 [2018-11-07 16:45:02,227 INFO L226 Difference]: Without dead ends: 149 [2018-11-07 16:45:02,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 247 SyntacticMatches, 28 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=854, Invalid=2686, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 16:45:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-07 16:45:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-07 16:45:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-07 16:45:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-11-07 16:45:02,237 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2018-11-07 16:45:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:02,238 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-11-07 16:45:02,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 16:45:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-11-07 16:45:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 16:45:02,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:02,239 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:02,239 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:02,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash -349719049, now seen corresponding path program 26 times [2018-11-07 16:45:02,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:02,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:02,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:02,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 235 proven. 388 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:45:02,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:02,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:02,718 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:02,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:02,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:02,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:02,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:02,727 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:02,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 16:45:02,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:02,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 236 proven. 351 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:45:02,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 236 proven. 351 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:45:03,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:03,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 22 [2018-11-07 16:45:03,213 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:03,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:45:03,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:45:03,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:45:03,213 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 22 states. [2018-11-07 16:45:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:03,466 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-11-07 16:45:03,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:45:03,466 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 146 [2018-11-07 16:45:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:03,468 INFO L225 Difference]: With dead ends: 159 [2018-11-07 16:45:03,468 INFO L226 Difference]: Without dead ends: 157 [2018-11-07 16:45:03,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 277 SyntacticMatches, 29 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:45:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-07 16:45:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-11-07 16:45:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-07 16:45:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-11-07 16:45:03,476 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 146 [2018-11-07 16:45:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:03,476 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-11-07 16:45:03,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:45:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-11-07 16:45:03,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-07 16:45:03,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:03,477 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:03,478 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:03,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:03,478 INFO L82 PathProgramCache]: Analyzing trace with hash -76381157, now seen corresponding path program 27 times [2018-11-07 16:45:03,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:03,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:03,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:03,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:03,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 434 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-07 16:45:04,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:04,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:04,105 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:04,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:04,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:04,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:04,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:04,115 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:04,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:04,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:04,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 434 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-07 16:45:04,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 434 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-07 16:45:05,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:05,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 48 [2018-11-07 16:45:05,314 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:05,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 16:45:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 16:45:05,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1713, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:45:05,316 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 48 states. [2018-11-07 16:45:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:05,796 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2018-11-07 16:45:05,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 16:45:05,798 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 154 [2018-11-07 16:45:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:05,799 INFO L225 Difference]: With dead ends: 228 [2018-11-07 16:45:05,799 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 16:45:05,801 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 264 SyntacticMatches, 30 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:45:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 16:45:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-07 16:45:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-07 16:45:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-11-07 16:45:05,819 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-11-07 16:45:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:05,819 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-11-07 16:45:05,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 16:45:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-11-07 16:45:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-07 16:45:05,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:05,820 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:05,820 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:05,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1136207573, now seen corresponding path program 28 times [2018-11-07 16:45:05,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:05,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:05,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:05,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:05,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 267 proven. 446 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 16:45:06,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:06,234 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:06,234 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:06,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:06,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:06,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:06,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:06,244 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:06,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 268 proven. 406 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-07 16:45:06,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 268 proven. 406 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-07 16:45:06,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:06,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 23 [2018-11-07 16:45:06,626 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:06,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 16:45:06,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 16:45:06,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2018-11-07 16:45:06,627 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 23 states. [2018-11-07 16:45:07,298 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-07 16:45:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:07,351 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-11-07 16:45:07,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:45:07,351 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 156 [2018-11-07 16:45:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:07,352 INFO L225 Difference]: With dead ends: 169 [2018-11-07 16:45:07,352 INFO L226 Difference]: Without dead ends: 167 [2018-11-07 16:45:07,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 296 SyntacticMatches, 31 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2018-11-07 16:45:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-07 16:45:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-11-07 16:45:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 16:45:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-11-07 16:45:07,361 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 156 [2018-11-07 16:45:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:07,361 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-11-07 16:45:07,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 16:45:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-11-07 16:45:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-07 16:45:07,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:07,362 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:07,362 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:07,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:07,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1226033415, now seen corresponding path program 29 times [2018-11-07 16:45:07,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:07,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:07,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 495 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:45:07,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:07,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:07,908 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:07,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:07,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:07,908 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:07,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:07,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:08,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-07 16:45:08,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:08,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 495 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:45:08,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 495 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:45:09,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:09,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-11-07 16:45:09,166 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:09,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 16:45:09,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 16:45:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=1939, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 16:45:09,168 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 51 states. [2018-11-07 16:45:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:10,284 INFO L93 Difference]: Finished difference Result 242 states and 259 transitions. [2018-11-07 16:45:10,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 16:45:10,292 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 164 [2018-11-07 16:45:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:10,293 INFO L225 Difference]: With dead ends: 242 [2018-11-07 16:45:10,293 INFO L226 Difference]: Without dead ends: 169 [2018-11-07 16:45:10,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 281 SyntacticMatches, 32 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1087, Invalid=3469, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 16:45:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-07 16:45:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-11-07 16:45:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-07 16:45:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-11-07 16:45:10,304 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2018-11-07 16:45:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:10,305 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-11-07 16:45:10,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 16:45:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-11-07 16:45:10,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 16:45:10,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:10,306 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:10,306 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:10,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash -956679885, now seen corresponding path program 30 times [2018-11-07 16:45:10,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:10,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:10,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:10,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:10,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 301 proven. 508 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-07 16:45:10,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:10,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:10,632 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:10,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:10,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:10,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:10,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:10,641 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:10,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:10,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:10,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 302 proven. 465 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:45:11,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 302 proven. 465 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-07 16:45:12,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 24 [2018-11-07 16:45:12,055 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:12,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:45:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:45:12,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:45:12,057 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 24 states. [2018-11-07 16:45:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:12,385 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-11-07 16:45:12,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:45:12,386 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 166 [2018-11-07 16:45:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:12,388 INFO L225 Difference]: With dead ends: 179 [2018-11-07 16:45:12,388 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 16:45:12,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 315 SyntacticMatches, 33 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:45:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 16:45:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-07 16:45:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-07 16:45:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-11-07 16:45:12,397 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 166 [2018-11-07 16:45:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:12,398 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-11-07 16:45:12,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:45:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-11-07 16:45:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 16:45:12,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:12,399 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:12,400 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:12,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:12,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1441002665, now seen corresponding path program 31 times [2018-11-07 16:45:12,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:12,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:12,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:12,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:12,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 560 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-07 16:45:13,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:13,484 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:13,484 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:13,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:13,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:13,485 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:13,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:13,493 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:13,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 560 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-07 16:45:14,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 560 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-07 16:45:14,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:14,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 54 [2018-11-07 16:45:14,909 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:14,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 16:45:14,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 16:45:14,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:45:14,911 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 54 states. [2018-11-07 16:45:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:17,518 INFO L93 Difference]: Finished difference Result 256 states and 274 transitions. [2018-11-07 16:45:17,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 16:45:17,519 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 174 [2018-11-07 16:45:17,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:17,520 INFO L225 Difference]: With dead ends: 256 [2018-11-07 16:45:17,520 INFO L226 Difference]: Without dead ends: 179 [2018-11-07 16:45:17,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 298 SyntacticMatches, 34 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1214, Invalid=3898, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 16:45:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-07 16:45:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-11-07 16:45:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-07 16:45:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-11-07 16:45:17,531 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2018-11-07 16:45:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:17,532 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-11-07 16:45:17,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 16:45:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-11-07 16:45:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 16:45:17,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:17,533 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:17,533 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:17,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash 98569489, now seen corresponding path program 32 times [2018-11-07 16:45:17,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:17,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:17,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:17,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 337 proven. 574 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-07 16:45:17,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:17,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:17,830 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:17,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:17,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:17,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:17,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:17,838 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:17,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 16:45:17,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:17,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 338 proven. 528 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-07 16:45:17,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 338 proven. 528 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-07 16:45:18,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:18,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 25 [2018-11-07 16:45:18,345 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:18,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:45:18,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:45:18,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-11-07 16:45:18,346 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 25 states. [2018-11-07 16:45:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:19,827 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-11-07 16:45:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:45:19,828 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 176 [2018-11-07 16:45:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:19,829 INFO L225 Difference]: With dead ends: 189 [2018-11-07 16:45:19,830 INFO L226 Difference]: Without dead ends: 187 [2018-11-07 16:45:19,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 334 SyntacticMatches, 35 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-11-07 16:45:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-07 16:45:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-11-07 16:45:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-07 16:45:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-11-07 16:45:19,839 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 176 [2018-11-07 16:45:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:19,839 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-11-07 16:45:19,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:45:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-11-07 16:45:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-07 16:45:19,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:19,840 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:19,841 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:19,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash 785850677, now seen corresponding path program 33 times [2018-11-07 16:45:19,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:19,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:19,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 629 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:45:20,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:20,956 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:20,956 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:20,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:20,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:20,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:20,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:20,966 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:21,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:21,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:21,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 629 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:45:21,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 629 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:45:22,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:22,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 57 [2018-11-07 16:45:22,448 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:22,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-07 16:45:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-07 16:45:22,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=2433, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 16:45:22,449 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 57 states. [2018-11-07 16:45:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:23,546 INFO L93 Difference]: Finished difference Result 270 states and 289 transitions. [2018-11-07 16:45:23,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:45:23,547 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 184 [2018-11-07 16:45:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:23,548 INFO L225 Difference]: With dead ends: 270 [2018-11-07 16:45:23,548 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 16:45:23,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 315 SyntacticMatches, 36 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1348, Invalid=4352, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 16:45:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 16:45:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-11-07 16:45:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 16:45:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-11-07 16:45:23,558 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 184 [2018-11-07 16:45:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:23,559 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-11-07 16:45:23,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-07 16:45:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-11-07 16:45:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-07 16:45:23,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:23,560 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:23,561 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:23,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1200110993, now seen corresponding path program 34 times [2018-11-07 16:45:23,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:23,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:23,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:23,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:23,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 375 proven. 644 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:45:23,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:23,884 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:23,885 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:23,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:23,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:23,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:23,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:23,894 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:23,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 376 proven. 595 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:45:24,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 376 proven. 595 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:45:24,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:24,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 26 [2018-11-07 16:45:24,442 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:24,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 16:45:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 16:45:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=428, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:45:24,443 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 26 states. [2018-11-07 16:45:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:24,692 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-11-07 16:45:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:45:24,692 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 186 [2018-11-07 16:45:24,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:24,695 INFO L225 Difference]: With dead ends: 199 [2018-11-07 16:45:24,695 INFO L226 Difference]: Without dead ends: 197 [2018-11-07 16:45:24,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 353 SyntacticMatches, 37 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:45:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-07 16:45:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-11-07 16:45:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-07 16:45:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-11-07 16:45:24,705 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 186 [2018-11-07 16:45:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:24,705 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-11-07 16:45:24,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 16:45:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-11-07 16:45:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 16:45:24,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:24,707 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:24,707 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:24,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash 772446355, now seen corresponding path program 35 times [2018-11-07 16:45:24,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:24,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:24,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:24,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:24,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 702 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-07 16:45:26,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:26,627 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:26,627 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:26,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:26,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:26,628 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:26,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:26,637 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:26,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-07 16:45:26,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:26,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 702 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-07 16:45:27,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 702 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-07 16:45:28,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:28,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 60 [2018-11-07 16:45:28,260 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:28,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 16:45:28,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 16:45:28,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=2701, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 16:45:28,262 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 60 states. [2018-11-07 16:45:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:29,468 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2018-11-07 16:45:29,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 16:45:29,468 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 194 [2018-11-07 16:45:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:29,469 INFO L225 Difference]: With dead ends: 284 [2018-11-07 16:45:29,469 INFO L226 Difference]: Without dead ends: 199 [2018-11-07 16:45:29,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 332 SyntacticMatches, 38 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1489, Invalid=4831, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 16:45:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-07 16:45:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-07 16:45:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 16:45:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-11-07 16:45:29,480 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 194 [2018-11-07 16:45:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:29,480 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-11-07 16:45:29,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 16:45:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-11-07 16:45:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-07 16:45:29,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:29,482 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:29,482 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:29,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:29,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1075414707, now seen corresponding path program 36 times [2018-11-07 16:45:29,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:29,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:29,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:29,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:29,483 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 415 proven. 718 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-07 16:45:30,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:30,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:30,097 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:30,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:30,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:30,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:30,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:30,105 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:30,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:30,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:30,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 416 proven. 666 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-07 16:45:30,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 416 proven. 666 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-07 16:45:30,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:30,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 27 [2018-11-07 16:45:30,617 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:30,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:45:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:45:30,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-11-07 16:45:30,618 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 27 states. [2018-11-07 16:45:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:30,999 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-11-07 16:45:30,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 16:45:30,999 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 196 [2018-11-07 16:45:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:31,000 INFO L225 Difference]: With dead ends: 209 [2018-11-07 16:45:31,000 INFO L226 Difference]: Without dead ends: 207 [2018-11-07 16:45:31,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 372 SyntacticMatches, 39 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:45:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-07 16:45:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-11-07 16:45:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-07 16:45:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-11-07 16:45:31,010 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 196 [2018-11-07 16:45:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:31,010 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-11-07 16:45:31,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:45:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-11-07 16:45:31,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-07 16:45:31,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:31,012 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:31,012 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:31,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:31,012 INFO L82 PathProgramCache]: Analyzing trace with hash 565940593, now seen corresponding path program 37 times [2018-11-07 16:45:31,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:31,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:31,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:31,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:31,014 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 779 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:45:31,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:31,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:31,721 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:31,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:31,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:31,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:31,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:31,732 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:31,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 779 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:45:32,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 779 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:45:33,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:33,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 63 [2018-11-07 16:45:33,107 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:33,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 16:45:33,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 16:45:33,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=923, Invalid=2983, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 16:45:33,108 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 63 states. [2018-11-07 16:45:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:34,396 INFO L93 Difference]: Finished difference Result 298 states and 319 transitions. [2018-11-07 16:45:34,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:45:34,397 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 204 [2018-11-07 16:45:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:34,398 INFO L225 Difference]: With dead ends: 298 [2018-11-07 16:45:34,398 INFO L226 Difference]: Without dead ends: 209 [2018-11-07 16:45:34,399 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 349 SyntacticMatches, 40 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2719 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1637, Invalid=5335, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 16:45:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-07 16:45:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-11-07 16:45:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-07 16:45:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-11-07 16:45:34,408 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2018-11-07 16:45:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:34,409 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-11-07 16:45:34,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 16:45:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-11-07 16:45:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 16:45:34,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:34,410 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:34,411 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:34,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:34,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1469492821, now seen corresponding path program 38 times [2018-11-07 16:45:34,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:34,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:34,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 457 proven. 796 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-07 16:45:34,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:34,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:34,869 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:34,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:34,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:34,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:34,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:34,878 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:34,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 16:45:34,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:34,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 458 proven. 741 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:45:35,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 458 proven. 741 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-07 16:45:35,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:35,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 28 [2018-11-07 16:45:35,988 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:35,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:45:35,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:45:35,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=491, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:45:35,989 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 28 states. [2018-11-07 16:45:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:36,361 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-11-07 16:45:36,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 16:45:36,362 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 206 [2018-11-07 16:45:36,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:36,364 INFO L225 Difference]: With dead ends: 219 [2018-11-07 16:45:36,364 INFO L226 Difference]: Without dead ends: 217 [2018-11-07 16:45:36,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 391 SyntacticMatches, 41 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=278, Invalid=592, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:45:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-07 16:45:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-11-07 16:45:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-07 16:45:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-11-07 16:45:36,375 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 206 [2018-11-07 16:45:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:36,375 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-11-07 16:45:36,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:45:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-11-07 16:45:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 16:45:36,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:36,377 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:36,377 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:36,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:36,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1761137713, now seen corresponding path program 39 times [2018-11-07 16:45:36,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:36,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:36,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:36,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:36,379 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 860 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-07 16:45:37,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:37,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:37,188 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:37,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:37,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:37,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:37,197 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:37,198 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:37,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:37,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:37,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 860 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-07 16:45:38,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 860 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-07 16:45:38,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:38,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 66 [2018-11-07 16:45:38,767 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:38,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-07 16:45:38,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-07 16:45:38,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=3279, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 16:45:38,769 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 66 states. [2018-11-07 16:45:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:41,049 INFO L93 Difference]: Finished difference Result 312 states and 334 transitions. [2018-11-07 16:45:41,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 16:45:41,050 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 214 [2018-11-07 16:45:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:41,051 INFO L225 Difference]: With dead ends: 312 [2018-11-07 16:45:41,051 INFO L226 Difference]: Without dead ends: 219 [2018-11-07 16:45:41,053 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 366 SyntacticMatches, 42 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1792, Invalid=5864, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 16:45:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-07 16:45:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-07 16:45:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-07 16:45:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-11-07 16:45:41,063 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 214 [2018-11-07 16:45:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:41,063 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-11-07 16:45:41,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-07 16:45:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-11-07 16:45:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 16:45:41,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:41,066 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:41,066 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:41,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1420465271, now seen corresponding path program 40 times [2018-11-07 16:45:41,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:41,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:41,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:41,068 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 501 proven. 878 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-07 16:45:42,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:42,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:42,770 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:42,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:42,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:42,770 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:42,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:42,778 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:42,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 502 proven. 820 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-07 16:45:42,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 502 proven. 820 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-07 16:45:43,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:43,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 29 [2018-11-07 16:45:43,437 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:43,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 16:45:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 16:45:43,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=524, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:45:43,438 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 29 states. [2018-11-07 16:45:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:43,700 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-11-07 16:45:43,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:45:43,701 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 216 [2018-11-07 16:45:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:43,703 INFO L225 Difference]: With dead ends: 229 [2018-11-07 16:45:43,703 INFO L226 Difference]: Without dead ends: 227 [2018-11-07 16:45:43,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 410 SyntacticMatches, 43 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=301, Invalid=629, Unknown=0, NotChecked=0, Total=930 [2018-11-07 16:45:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-07 16:45:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-11-07 16:45:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-07 16:45:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-11-07 16:45:43,713 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 216 [2018-11-07 16:45:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:43,713 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-11-07 16:45:43,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 16:45:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-11-07 16:45:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-07 16:45:43,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:43,715 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:43,715 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:43,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:43,716 INFO L82 PathProgramCache]: Analyzing trace with hash 807569325, now seen corresponding path program 41 times [2018-11-07 16:45:43,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:43,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:43,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:43,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:43,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 945 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:45:45,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:45,351 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:45,351 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:45,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:45,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:45,352 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:45,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:45,368 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:45,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-07 16:45:45,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:45,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 945 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:45:46,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 945 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:45:47,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:47,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 69 [2018-11-07 16:45:47,330 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:47,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-07 16:45:47,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-07 16:45:47,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1103, Invalid=3589, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 16:45:47,332 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 69 states. [2018-11-07 16:45:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:48,805 INFO L93 Difference]: Finished difference Result 326 states and 349 transitions. [2018-11-07 16:45:48,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 16:45:48,805 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 224 [2018-11-07 16:45:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:48,806 INFO L225 Difference]: With dead ends: 326 [2018-11-07 16:45:48,806 INFO L226 Difference]: Without dead ends: 229 [2018-11-07 16:45:48,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 383 SyntacticMatches, 44 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3299 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1954, Invalid=6418, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 16:45:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-07 16:45:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-11-07 16:45:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-07 16:45:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-11-07 16:45:48,818 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 224 [2018-11-07 16:45:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:48,818 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-11-07 16:45:48,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-07 16:45:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-11-07 16:45:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-07 16:45:48,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:48,820 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:48,820 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:48,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:48,821 INFO L82 PathProgramCache]: Analyzing trace with hash 823650023, now seen corresponding path program 42 times [2018-11-07 16:45:48,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:48,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:48,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:48,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 547 proven. 964 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-07 16:45:49,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:49,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:49,402 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:49,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:49,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:49,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:49,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:49,411 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:49,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:49,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:49,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 548 proven. 903 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:45:49,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 548 proven. 903 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-07 16:45:50,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:50,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 30 [2018-11-07 16:45:50,058 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:50,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 16:45:50,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 16:45:50,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:45:50,059 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 30 states. [2018-11-07 16:45:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:50,349 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2018-11-07 16:45:50,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 16:45:50,350 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 226 [2018-11-07 16:45:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:50,352 INFO L225 Difference]: With dead ends: 239 [2018-11-07 16:45:50,352 INFO L226 Difference]: Without dead ends: 237 [2018-11-07 16:45:50,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 429 SyntacticMatches, 45 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=667, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:45:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-07 16:45:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-11-07 16:45:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-07 16:45:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-11-07 16:45:50,363 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 226 [2018-11-07 16:45:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:50,364 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-11-07 16:45:50,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 16:45:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-11-07 16:45:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-07 16:45:50,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:50,365 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:50,365 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:50,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:50,366 INFO L82 PathProgramCache]: Analyzing trace with hash 643482891, now seen corresponding path program 43 times [2018-11-07 16:45:50,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:50,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:50,367 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1034 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-07 16:45:51,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:51,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:51,554 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:51,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:51,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:51,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:51,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:51,564 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:51,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1034 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-07 16:45:52,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1034 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-07 16:45:53,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:53,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 72 [2018-11-07 16:45:53,335 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:53,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-07 16:45:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-07 16:45:53,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=3913, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 16:45:53,336 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 72 states. [2018-11-07 16:45:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:54,507 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2018-11-07 16:45:54,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 16:45:54,508 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 234 [2018-11-07 16:45:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:54,509 INFO L225 Difference]: With dead ends: 340 [2018-11-07 16:45:54,510 INFO L226 Difference]: Without dead ends: 239 [2018-11-07 16:45:54,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 400 SyntacticMatches, 46 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3610 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2123, Invalid=6997, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 16:45:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-07 16:45:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-11-07 16:45:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-07 16:45:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-11-07 16:45:54,522 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 234 [2018-11-07 16:45:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:54,523 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-11-07 16:45:54,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-07 16:45:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-11-07 16:45:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-07 16:45:54,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:54,525 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:54,525 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:54,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:54,525 INFO L82 PathProgramCache]: Analyzing trace with hash -751443003, now seen corresponding path program 44 times [2018-11-07 16:45:54,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:54,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:54,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:54,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:54,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 595 proven. 1054 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-11-07 16:45:55,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:55,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:55,188 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:55,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:55,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:55,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:55,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:45:55,197 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:45:55,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 16:45:55,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:55,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 596 proven. 990 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-07 16:45:55,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 596 proven. 990 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-07 16:45:57,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:57,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 31 [2018-11-07 16:45:57,116 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:57,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:45:57,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:45:57,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=593, Unknown=0, NotChecked=0, Total=930 [2018-11-07 16:45:57,117 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 31 states. [2018-11-07 16:45:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:57,430 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-11-07 16:45:57,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 16:45:57,431 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 236 [2018-11-07 16:45:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:57,433 INFO L225 Difference]: With dead ends: 249 [2018-11-07 16:45:57,433 INFO L226 Difference]: Without dead ends: 247 [2018-11-07 16:45:57,434 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 448 SyntacticMatches, 47 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=350, Invalid=706, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 16:45:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-07 16:45:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-11-07 16:45:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-07 16:45:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-11-07 16:45:57,445 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 236 [2018-11-07 16:45:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:57,445 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-11-07 16:45:57,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:45:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-11-07 16:45:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-07 16:45:57,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:57,447 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:57,447 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:57,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1276445673, now seen corresponding path program 45 times [2018-11-07 16:45:57,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:57,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:57,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:45:57,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:57,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2691 backedges. 1127 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:45:58,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:58,652 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:58,652 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:45:58,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:45:58,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:58,652 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:45:58,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:45:58,662 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:45:58,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:45:58,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:45:58,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2691 backedges. 1127 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:45:59,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2691 backedges. 1127 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:46:00,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:00,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 75 [2018-11-07 16:46:00,744 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:00,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 16:46:00,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 16:46:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=4251, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 16:46:00,745 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 75 states. [2018-11-07 16:46:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:02,496 INFO L93 Difference]: Finished difference Result 354 states and 379 transitions. [2018-11-07 16:46:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 16:46:02,497 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 244 [2018-11-07 16:46:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:02,498 INFO L225 Difference]: With dead ends: 354 [2018-11-07 16:46:02,498 INFO L226 Difference]: Without dead ends: 249 [2018-11-07 16:46:02,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 417 SyntacticMatches, 48 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3935 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2299, Invalid=7601, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 16:46:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-07 16:46:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-11-07 16:46:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-07 16:46:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-11-07 16:46:02,510 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 244 [2018-11-07 16:46:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:02,510 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-11-07 16:46:02,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 16:46:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-11-07 16:46:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-07 16:46:02,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:02,512 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:02,512 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:02,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash -565411293, now seen corresponding path program 46 times [2018-11-07 16:46:02,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:02,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:02,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 645 proven. 1148 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-11-07 16:46:03,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:03,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:03,630 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:03,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:03,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:03,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:03,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:03,640 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:03,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 646 proven. 1081 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:46:03,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 646 proven. 1081 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-07 16:46:04,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 32 [2018-11-07 16:46:04,407 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:04,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 16:46:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 16:46:04,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=629, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:46:04,408 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 32 states. [2018-11-07 16:46:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:04,706 INFO L93 Difference]: Finished difference Result 259 states and 260 transitions. [2018-11-07 16:46:04,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:46:04,707 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 246 [2018-11-07 16:46:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:04,709 INFO L225 Difference]: With dead ends: 259 [2018-11-07 16:46:04,709 INFO L226 Difference]: Without dead ends: 257 [2018-11-07 16:46:04,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 467 SyntacticMatches, 49 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=376, Invalid=746, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:46:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-07 16:46:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-11-07 16:46:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-07 16:46:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-11-07 16:46:04,720 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 246 [2018-11-07 16:46:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:04,721 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-11-07 16:46:04,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 16:46:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-11-07 16:46:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-07 16:46:04,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:04,722 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:04,723 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:04,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:04,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1899076537, now seen corresponding path program 47 times [2018-11-07 16:46:04,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:04,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:04,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:04,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:04,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1224 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-07 16:46:05,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:05,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:05,996 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:05,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:05,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:05,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:06,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:06,005 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:06,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-11-07 16:46:06,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:06,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1224 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-07 16:46:07,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1224 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-07 16:46:08,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:08,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 78 [2018-11-07 16:46:08,370 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:08,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-07 16:46:08,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-07 16:46:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=4603, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 16:46:08,372 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 78 states. [2018-11-07 16:46:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:10,731 INFO L93 Difference]: Finished difference Result 368 states and 394 transitions. [2018-11-07 16:46:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 16:46:10,731 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 254 [2018-11-07 16:46:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:10,733 INFO L225 Difference]: With dead ends: 368 [2018-11-07 16:46:10,733 INFO L226 Difference]: Without dead ends: 259 [2018-11-07 16:46:10,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 434 SyntacticMatches, 50 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4274 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2482, Invalid=8230, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 16:46:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-07 16:46:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-11-07 16:46:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-07 16:46:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-11-07 16:46:10,746 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 254 [2018-11-07 16:46:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:10,746 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-11-07 16:46:10,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-07 16:46:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-11-07 16:46:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-07 16:46:10,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:10,748 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:10,748 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:10,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1410392577, now seen corresponding path program 48 times [2018-11-07 16:46:10,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:10,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:10,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2978 backedges. 697 proven. 1246 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-11-07 16:46:11,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:11,223 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:11,223 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:11,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:11,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:11,223 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:11,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:11,232 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:11,306 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:11,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:11,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2978 backedges. 698 proven. 1176 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-07 16:46:12,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2978 backedges. 698 proven. 1176 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-07 16:46:12,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:12,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 33 [2018-11-07 16:46:12,783 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:12,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 16:46:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 16:46:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=666, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 16:46:12,784 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 33 states. [2018-11-07 16:46:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:13,145 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-11-07 16:46:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 16:46:13,145 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 256 [2018-11-07 16:46:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:13,148 INFO L225 Difference]: With dead ends: 269 [2018-11-07 16:46:13,148 INFO L226 Difference]: Without dead ends: 267 [2018-11-07 16:46:13,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 486 SyntacticMatches, 51 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 16:46:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-07 16:46:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-07 16:46:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-07 16:46:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-11-07 16:46:13,160 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 256 [2018-11-07 16:46:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:13,161 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-11-07 16:46:13,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 16:46:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-11-07 16:46:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-07 16:46:13,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:13,163 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:13,163 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:13,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:13,163 INFO L82 PathProgramCache]: Analyzing trace with hash -115603931, now seen corresponding path program 49 times [2018-11-07 16:46:13,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:13,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:13,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:13,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:13,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3175 backedges. 1325 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:46:14,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:14,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:14,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:14,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:14,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:14,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:14,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:14,176 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:14,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3175 backedges. 1325 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:46:15,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3175 backedges. 1325 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:46:16,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:16,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 81 [2018-11-07 16:46:16,303 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:16,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-07 16:46:16,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-07 16:46:16,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1511, Invalid=4969, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 16:46:16,305 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 81 states. [2018-11-07 16:46:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:18,587 INFO L93 Difference]: Finished difference Result 382 states and 409 transitions. [2018-11-07 16:46:18,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 16:46:18,587 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 264 [2018-11-07 16:46:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:18,588 INFO L225 Difference]: With dead ends: 382 [2018-11-07 16:46:18,588 INFO L226 Difference]: Without dead ends: 269 [2018-11-07 16:46:18,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 451 SyntacticMatches, 52 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4627 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2672, Invalid=8884, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 16:46:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-07 16:46:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-11-07 16:46:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-07 16:46:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-11-07 16:46:18,599 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 264 [2018-11-07 16:46:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:18,600 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-11-07 16:46:18,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-07 16:46:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-11-07 16:46:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-07 16:46:18,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:18,602 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:18,602 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:18,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:18,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1833968479, now seen corresponding path program 50 times [2018-11-07 16:46:18,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:18,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:18,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:18,603 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 751 proven. 1348 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-07 16:46:19,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:19,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:19,660 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:19,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 16:46:19,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:19,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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:19,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:19,670 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:19,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 16:46:19,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:19,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 752 proven. 1275 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:46:19,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 752 proven. 1275 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-07 16:46:20,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:20,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 34 [2018-11-07 16:46:20,772 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:20,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 16:46:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 16:46:20,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=704, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:46:20,773 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 34 states. [2018-11-07 16:46:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:21,133 INFO L93 Difference]: Finished difference Result 279 states and 280 transitions. [2018-11-07 16:46:21,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 16:46:21,134 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 266 [2018-11-07 16:46:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:21,136 INFO L225 Difference]: With dead ends: 279 [2018-11-07 16:46:21,136 INFO L226 Difference]: Without dead ends: 277 [2018-11-07 16:46:21,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 505 SyntacticMatches, 53 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=431, Invalid=829, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:46:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-07 16:46:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-11-07 16:46:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-07 16:46:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-11-07 16:46:21,148 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 266 [2018-11-07 16:46:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:21,148 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-11-07 16:46:21,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 16:46:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-11-07 16:46:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-07 16:46:21,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:21,150 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:21,150 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:21,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:21,150 INFO L82 PathProgramCache]: Analyzing trace with hash 883624323, now seen corresponding path program 51 times [2018-11-07 16:46:21,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:21,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:21,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:21,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:21,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1430 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-07 16:46:22,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:22,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:22,648 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:22,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:22,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:22,649 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:22,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:22,657 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:22,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:22,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:22,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1430 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-07 16:46:24,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1430 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-07 16:46:25,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:25,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 84 [2018-11-07 16:46:25,058 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:25,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-07 16:46:25,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-07 16:46:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1623, Invalid=5349, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 16:46:25,060 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 84 states. [2018-11-07 16:46:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:26,409 INFO L93 Difference]: Finished difference Result 396 states and 424 transitions. [2018-11-07 16:46:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 16:46:26,409 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 274 [2018-11-07 16:46:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:26,410 INFO L225 Difference]: With dead ends: 396 [2018-11-07 16:46:26,410 INFO L226 Difference]: Without dead ends: 279 [2018-11-07 16:46:26,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 468 SyntacticMatches, 54 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4994 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2869, Invalid=9563, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 16:46:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-07 16:46:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-11-07 16:46:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-07 16:46:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-11-07 16:46:26,420 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 274 [2018-11-07 16:46:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:26,421 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-11-07 16:46:26,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-07 16:46:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-11-07 16:46:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-11-07 16:46:26,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:26,423 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:26,423 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:26,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:26,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1678809539, now seen corresponding path program 52 times [2018-11-07 16:46:26,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:26,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:26,424 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 807 proven. 1454 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-11-07 16:46:27,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:27,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:27,112 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:27,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:27,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:27,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:27,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:27,122 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:27,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 808 proven. 1378 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-07 16:46:27,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 808 proven. 1378 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-07 16:46:28,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:28,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 35 [2018-11-07 16:46:28,062 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:28,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 16:46:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 16:46:28,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=743, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 16:46:28,063 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 35 states. [2018-11-07 16:46:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:28,460 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-11-07 16:46:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 16:46:28,460 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 276 [2018-11-07 16:46:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:28,462 INFO L225 Difference]: With dead ends: 289 [2018-11-07 16:46:28,462 INFO L226 Difference]: Without dead ends: 287 [2018-11-07 16:46:28,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 524 SyntacticMatches, 55 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=460, Invalid=872, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 16:46:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-07 16:46:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-11-07 16:46:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-07 16:46:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-11-07 16:46:28,474 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 276 [2018-11-07 16:46:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:28,475 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-11-07 16:46:28,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 16:46:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-11-07 16:46:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-07 16:46:28,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:28,477 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:28,477 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:28,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1941926303, now seen corresponding path program 53 times [2018-11-07 16:46:28,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:28,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:28,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 1539 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:46:29,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:29,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:29,737 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:29,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:29,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:29,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:29,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:29,748 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:29,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-07 16:46:29,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:29,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 1539 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:46:31,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 1539 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:46:32,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:32,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 87 [2018-11-07 16:46:32,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:32,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-11-07 16:46:32,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-11-07 16:46:32,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1739, Invalid=5743, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 16:46:32,383 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 87 states. [2018-11-07 16:46:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:33,674 INFO L93 Difference]: Finished difference Result 410 states and 439 transitions. [2018-11-07 16:46:33,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 16:46:33,674 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 284 [2018-11-07 16:46:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:33,676 INFO L225 Difference]: With dead ends: 410 [2018-11-07 16:46:33,676 INFO L226 Difference]: Without dead ends: 289 [2018-11-07 16:46:33,677 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 485 SyntacticMatches, 56 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5375 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3073, Invalid=10267, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 16:46:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-07 16:46:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-11-07 16:46:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-07 16:46:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-11-07 16:46:33,690 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-11-07 16:46:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:33,690 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-11-07 16:46:33,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-11-07 16:46:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-11-07 16:46:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-07 16:46:33,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:33,692 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:33,692 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:33,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash 216779419, now seen corresponding path program 54 times [2018-11-07 16:46:33,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:33,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:33,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:33,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3755 backedges. 865 proven. 1564 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-11-07 16:46:34,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:34,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:34,362 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:34,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:34,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:34,363 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:34,371 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:34,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:34,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:34,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3755 backedges. 866 proven. 1485 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:46:34,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3755 backedges. 866 proven. 1485 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-07 16:46:35,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:35,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 36 [2018-11-07 16:46:35,298 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:35,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 16:46:35,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 16:46:35,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:46:35,299 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 36 states. [2018-11-07 16:46:35,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:35,645 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-11-07 16:46:35,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 16:46:35,646 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 286 [2018-11-07 16:46:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:35,648 INFO L225 Difference]: With dead ends: 299 [2018-11-07 16:46:35,648 INFO L226 Difference]: Without dead ends: 297 [2018-11-07 16:46:35,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 543 SyntacticMatches, 57 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=916, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:46:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-07 16:46:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-11-07 16:46:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-07 16:46:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-11-07 16:46:35,660 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 286 [2018-11-07 16:46:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:35,660 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-11-07 16:46:35,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 16:46:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-11-07 16:46:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-07 16:46:35,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:35,662 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:35,662 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:35,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:35,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1840886975, now seen corresponding path program 55 times [2018-11-07 16:46:35,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:35,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:35,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:35,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:35,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1652 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-07 16:46:36,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:36,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:36,945 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:36,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:36,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:36,946 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:36,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:36,954 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:37,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1652 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-07 16:46:38,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1652 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-07 16:46:39,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:39,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 90 [2018-11-07 16:46:39,928 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:39,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-11-07 16:46:39,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-11-07 16:46:39,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1859, Invalid=6151, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 16:46:39,929 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 90 states. [2018-11-07 16:46:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:41,818 INFO L93 Difference]: Finished difference Result 424 states and 454 transitions. [2018-11-07 16:46:41,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-07 16:46:41,818 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 294 [2018-11-07 16:46:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:41,820 INFO L225 Difference]: With dead ends: 424 [2018-11-07 16:46:41,820 INFO L226 Difference]: Without dead ends: 299 [2018-11-07 16:46:41,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 502 SyntacticMatches, 58 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5770 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3284, Invalid=10996, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 16:46:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-07 16:46:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-11-07 16:46:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-07 16:46:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-11-07 16:46:41,831 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-11-07 16:46:41,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:41,832 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-11-07 16:46:41,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-11-07 16:46:41,832 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-11-07 16:46:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 16:46:41,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:41,833 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:41,833 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:41,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1436913543, now seen corresponding path program 56 times [2018-11-07 16:46:41,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:41,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:41,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:41,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:41,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4034 backedges. 925 proven. 1678 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-11-07 16:46:42,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:42,742 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:42,743 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:42,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:42,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:42,743 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:42,752 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:42,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 16:46:42,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:42,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4034 backedges. 926 proven. 1596 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-07 16:46:42,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4034 backedges. 926 proven. 1596 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-07 16:46:43,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:43,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 37 [2018-11-07 16:46:43,765 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:43,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 16:46:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 16:46:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=824, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 16:46:43,766 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 37 states. [2018-11-07 16:46:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:44,201 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-11-07 16:46:44,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 16:46:44,202 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 296 [2018-11-07 16:46:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:44,204 INFO L225 Difference]: With dead ends: 309 [2018-11-07 16:46:44,204 INFO L226 Difference]: Without dead ends: 307 [2018-11-07 16:46:44,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 562 SyntacticMatches, 59 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=521, Invalid=961, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:46:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-07 16:46:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-07 16:46:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-07 16:46:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-11-07 16:46:44,213 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 296 [2018-11-07 16:46:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:44,213 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-11-07 16:46:44,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 16:46:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-11-07 16:46:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-07 16:46:44,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:44,214 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:44,215 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:44,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1812700317, now seen corresponding path program 57 times [2018-11-07 16:46:44,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:44,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:44,216 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1769 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:46:45,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:45,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:45,455 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:45,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 16:46:45,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:45,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:45,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:45,464 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:45,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:45,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:45,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1769 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:46:47,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1769 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:46:48,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:48,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 93 [2018-11-07 16:46:48,613 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:48,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-07 16:46:48,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-07 16:46:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1983, Invalid=6573, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 16:46:48,614 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 93 states. [2018-11-07 16:46:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:50,536 INFO L93 Difference]: Finished difference Result 438 states and 469 transitions. [2018-11-07 16:46:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 16:46:50,536 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 304 [2018-11-07 16:46:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:50,538 INFO L225 Difference]: With dead ends: 438 [2018-11-07 16:46:50,538 INFO L226 Difference]: Without dead ends: 309 [2018-11-07 16:46:50,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 519 SyntacticMatches, 60 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6179 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3502, Invalid=11750, Unknown=0, NotChecked=0, Total=15252 [2018-11-07 16:46:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-07 16:46:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-11-07 16:46:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-07 16:46:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-11-07 16:46:50,552 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 304 [2018-11-07 16:46:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:50,553 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-11-07 16:46:50,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-07 16:46:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-11-07 16:46:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-07 16:46:50,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:50,555 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:50,555 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:50,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1654097961, now seen corresponding path program 58 times [2018-11-07 16:46:50,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:50,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:50,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:50,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:50,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 987 proven. 1796 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-11-07 16:46:51,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:51,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:51,114 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:51,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:51,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:51,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:51,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:51,123 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:51,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 988 proven. 1711 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:46:51,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 988 proven. 1711 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-07 16:46:52,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:52,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 38 [2018-11-07 16:46:52,112 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:52,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 16:46:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 16:46:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=866, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:46:52,113 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 38 states. [2018-11-07 16:46:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:52,586 INFO L93 Difference]: Finished difference Result 319 states and 320 transitions. [2018-11-07 16:46:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 16:46:52,586 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 306 [2018-11-07 16:46:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:52,588 INFO L225 Difference]: With dead ends: 319 [2018-11-07 16:46:52,589 INFO L226 Difference]: Without dead ends: 317 [2018-11-07 16:46:52,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 581 SyntacticMatches, 61 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=553, Invalid=1007, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:46:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-11-07 16:46:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-11-07 16:46:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-07 16:46:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-11-07 16:46:52,598 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 306 [2018-11-07 16:46:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:52,598 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-11-07 16:46:52,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 16:46:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-11-07 16:46:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-07 16:46:52,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:52,600 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:52,600 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:52,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1052547589, now seen corresponding path program 59 times [2018-11-07 16:46:52,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:52,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:52,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:52,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:52,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1890 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-07 16:46:54,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:54,117 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:54,117 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:54,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:54,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:54,117 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:54,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:54,126 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:54,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-11-07 16:46:54,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:54,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1890 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-07 16:46:55,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1890 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-07 16:46:57,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:57,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 96 [2018-11-07 16:46:57,198 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:57,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-07 16:46:57,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-07 16:46:57,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=7009, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 16:46:57,199 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 96 states. [2018-11-07 16:46:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:59,410 INFO L93 Difference]: Finished difference Result 452 states and 484 transitions. [2018-11-07 16:46:59,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 16:46:59,410 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 314 [2018-11-07 16:46:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:59,412 INFO L225 Difference]: With dead ends: 452 [2018-11-07 16:46:59,412 INFO L226 Difference]: Without dead ends: 319 [2018-11-07 16:46:59,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 536 SyntacticMatches, 62 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6602 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3727, Invalid=12529, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 16:46:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-07 16:46:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-11-07 16:46:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-07 16:46:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-11-07 16:46:59,424 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 314 [2018-11-07 16:46:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:59,424 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-11-07 16:46:59,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-07 16:46:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-11-07 16:46:59,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-07 16:46:59,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:59,425 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:59,425 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:59,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:59,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1348141237, now seen corresponding path program 60 times [2018-11-07 16:46:59,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:59,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:59,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4622 backedges. 1051 proven. 1918 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-11-07 16:47:00,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:00,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:00,105 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:00,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:00,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:00,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:00,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:00,114 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:00,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:00,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:00,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4622 backedges. 1052 proven. 1830 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-07 16:47:00,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4622 backedges. 1052 proven. 1830 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-07 16:47:01,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:01,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 39 [2018-11-07 16:47:01,438 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:01,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:47:01,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:47:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:47:01,439 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 39 states. [2018-11-07 16:47:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:01,927 INFO L93 Difference]: Finished difference Result 329 states and 330 transitions. [2018-11-07 16:47:01,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 16:47:01,928 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 316 [2018-11-07 16:47:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:01,930 INFO L225 Difference]: With dead ends: 329 [2018-11-07 16:47:01,930 INFO L226 Difference]: Without dead ends: 327 [2018-11-07 16:47:01,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 600 SyntacticMatches, 63 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=586, Invalid=1054, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 16:47:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-07 16:47:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-11-07 16:47:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-11-07 16:47:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-11-07 16:47:01,940 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 316 [2018-11-07 16:47:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:01,940 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-11-07 16:47:01,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:47:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-11-07 16:47:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-07 16:47:01,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:01,942 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:01,942 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:01,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:01,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1350971609, now seen corresponding path program 61 times [2018-11-07 16:47:01,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:01,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:01,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:01,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:01,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4867 backedges. 2015 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:47:03,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:03,777 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:03,777 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:03,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:03,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:03,777 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:03,786 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:03,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4867 backedges. 2015 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:47:05,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4867 backedges. 2015 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:47:07,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:07,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 99 [2018-11-07 16:47:07,066 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:07,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-11-07 16:47:07,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-07 16:47:07,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2243, Invalid=7459, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 16:47:07,068 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 99 states. [2018-11-07 16:47:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:09,647 INFO L93 Difference]: Finished difference Result 466 states and 499 transitions. [2018-11-07 16:47:09,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 16:47:09,647 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 324 [2018-11-07 16:47:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:09,648 INFO L225 Difference]: With dead ends: 466 [2018-11-07 16:47:09,649 INFO L226 Difference]: Without dead ends: 329 [2018-11-07 16:47:09,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 553 SyntacticMatches, 64 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7039 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3959, Invalid=13333, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 16:47:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-07 16:47:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-11-07 16:47:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-07 16:47:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-11-07 16:47:09,666 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 324 [2018-11-07 16:47:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:09,666 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-11-07 16:47:09,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-11-07 16:47:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-11-07 16:47:09,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-07 16:47:09,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:09,669 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:09,669 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:09,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:09,670 INFO L82 PathProgramCache]: Analyzing trace with hash -259052781, now seen corresponding path program 62 times [2018-11-07 16:47:09,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:09,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:09,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:09,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:09,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 1117 proven. 2044 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-11-07 16:47:10,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:10,347 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:10,347 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:10,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:10,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:10,347 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:10,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:10,358 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:10,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 16:47:10,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:10,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 1118 proven. 1953 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:47:10,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 1118 proven. 1953 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-07 16:47:11,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:11,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 40 [2018-11-07 16:47:11,538 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:11,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 16:47:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 16:47:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=953, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:47:11,539 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 40 states. [2018-11-07 16:47:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:11,982 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-11-07 16:47:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:47:11,983 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 326 [2018-11-07 16:47:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:11,985 INFO L225 Difference]: With dead ends: 339 [2018-11-07 16:47:11,985 INFO L226 Difference]: Without dead ends: 337 [2018-11-07 16:47:11,986 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 619 SyntacticMatches, 65 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=620, Invalid=1102, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:47:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-07 16:47:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-11-07 16:47:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-07 16:47:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-11-07 16:47:12,001 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 326 [2018-11-07 16:47:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:12,002 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-11-07 16:47:12,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 16:47:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-11-07 16:47:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-07 16:47:12,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:12,004 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:12,004 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:12,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash 672210231, now seen corresponding path program 63 times [2018-11-07 16:47:12,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:12,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:12,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:12,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2144 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-07 16:47:13,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:13,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:13,966 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:13,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:13,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:13,967 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:13,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:13,976 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:14,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:14,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:14,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2144 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-07 16:47:15,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2144 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-07 16:47:17,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:17,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 102 [2018-11-07 16:47:17,315 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:17,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-11-07 16:47:17,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-11-07 16:47:17,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2379, Invalid=7923, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:47:17,316 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 102 states. [2018-11-07 16:47:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:19,819 INFO L93 Difference]: Finished difference Result 480 states and 514 transitions. [2018-11-07 16:47:19,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 16:47:19,820 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 334 [2018-11-07 16:47:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:19,821 INFO L225 Difference]: With dead ends: 480 [2018-11-07 16:47:19,821 INFO L226 Difference]: Without dead ends: 339 [2018-11-07 16:47:19,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 570 SyntacticMatches, 66 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7490 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4198, Invalid=14162, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 16:47:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-07 16:47:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-11-07 16:47:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-11-07 16:47:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-11-07 16:47:19,837 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 334 [2018-11-07 16:47:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:19,837 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-11-07 16:47:19,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-11-07 16:47:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-11-07 16:47:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-11-07 16:47:19,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:19,839 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:19,839 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:19,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:19,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1887049457, now seen corresponding path program 64 times [2018-11-07 16:47:19,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:19,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:19,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:19,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:19,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 1185 proven. 2174 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-11-07 16:47:20,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:20,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:20,710 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:20,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:20,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:20,710 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:20,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:20,720 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:20,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 1186 proven. 2080 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-07 16:47:20,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 1186 proven. 2080 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-07 16:47:21,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:21,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 41 [2018-11-07 16:47:21,970 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:21,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 16:47:21,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 16:47:21,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=998, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 16:47:21,971 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 41 states. [2018-11-07 16:47:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:22,468 INFO L93 Difference]: Finished difference Result 349 states and 350 transitions. [2018-11-07 16:47:22,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 16:47:22,468 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 336 [2018-11-07 16:47:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:22,470 INFO L225 Difference]: With dead ends: 349 [2018-11-07 16:47:22,471 INFO L226 Difference]: Without dead ends: 347 [2018-11-07 16:47:22,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 638 SyntacticMatches, 67 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 16:47:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-07 16:47:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-11-07 16:47:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-07 16:47:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-11-07 16:47:22,485 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 336 [2018-11-07 16:47:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:22,485 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-11-07 16:47:22,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 16:47:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-11-07 16:47:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-07 16:47:22,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:22,487 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:22,487 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:22,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2093397227, now seen corresponding path program 65 times [2018-11-07 16:47:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:22,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 2277 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:47:24,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:24,469 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:24,469 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:24,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:24,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:24,470 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:24,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:24,478 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:24,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-07 16:47:24,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:24,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 2277 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:47:26,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 2277 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:47:27,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:27,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 105 [2018-11-07 16:47:27,976 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:27,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-11-07 16:47:27,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-11-07 16:47:27,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2519, Invalid=8401, Unknown=0, NotChecked=0, Total=10920 [2018-11-07 16:47:27,977 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 105 states. [2018-11-07 16:47:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:30,637 INFO L93 Difference]: Finished difference Result 494 states and 529 transitions. [2018-11-07 16:47:30,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 16:47:30,638 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 344 [2018-11-07 16:47:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:30,639 INFO L225 Difference]: With dead ends: 494 [2018-11-07 16:47:30,639 INFO L226 Difference]: Without dead ends: 349 [2018-11-07 16:47:30,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 587 SyntacticMatches, 68 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7955 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4444, Invalid=15016, Unknown=0, NotChecked=0, Total=19460 [2018-11-07 16:47:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-07 16:47:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-11-07 16:47:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-11-07 16:47:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-11-07 16:47:30,653 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 344 [2018-11-07 16:47:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:30,653 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-11-07 16:47:30,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-11-07 16:47:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-11-07 16:47:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-07 16:47:30,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:30,655 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:30,655 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:30,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash 162063439, now seen corresponding path program 66 times [2018-11-07 16:47:30,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:30,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:30,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:30,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:30,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 1255 proven. 2308 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-11-07 16:47:31,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:31,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:31,325 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:31,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:31,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:31,325 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:31,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:31,333 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:31,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:31,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:31,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 1256 proven. 2211 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:47:31,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 1256 proven. 2211 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-07 16:47:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 42 [2018-11-07 16:47:32,650 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:32,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 16:47:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 16:47:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=1044, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:47:32,651 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 42 states. [2018-11-07 16:47:33,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:33,071 INFO L93 Difference]: Finished difference Result 359 states and 360 transitions. [2018-11-07 16:47:33,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 16:47:33,072 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 346 [2018-11-07 16:47:33,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:33,074 INFO L225 Difference]: With dead ends: 359 [2018-11-07 16:47:33,074 INFO L226 Difference]: Without dead ends: 357 [2018-11-07 16:47:33,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 657 SyntacticMatches, 69 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=691, Invalid=1201, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:47:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-07 16:47:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-11-07 16:47:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-11-07 16:47:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-11-07 16:47:33,086 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 346 [2018-11-07 16:47:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:33,086 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-11-07 16:47:33,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 16:47:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-11-07 16:47:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-07 16:47:33,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:33,089 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:33,089 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:33,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1282136691, now seen corresponding path program 67 times [2018-11-07 16:47:33,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:33,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:33,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 2414 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-07 16:47:35,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:35,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:35,221 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:35,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:35,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:35,221 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:35,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:35,230 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:35,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 2414 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-07 16:47:37,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 2414 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-07 16:47:39,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:39,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 108 [2018-11-07 16:47:39,184 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:39,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-11-07 16:47:39,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-11-07 16:47:39,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2663, Invalid=8893, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 16:47:39,186 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 108 states. [2018-11-07 16:47:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:41,738 INFO L93 Difference]: Finished difference Result 508 states and 544 transitions. [2018-11-07 16:47:41,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-07 16:47:41,738 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 354 [2018-11-07 16:47:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:41,740 INFO L225 Difference]: With dead ends: 508 [2018-11-07 16:47:41,740 INFO L226 Difference]: Without dead ends: 359 [2018-11-07 16:47:41,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 604 SyntacticMatches, 70 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8434 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4697, Invalid=15895, Unknown=0, NotChecked=0, Total=20592 [2018-11-07 16:47:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-11-07 16:47:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-11-07 16:47:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-07 16:47:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-11-07 16:47:41,754 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 354 [2018-11-07 16:47:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:41,754 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-11-07 16:47:41,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-11-07 16:47:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-11-07 16:47:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-07 16:47:41,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:41,756 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:41,756 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:41,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:41,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1052816173, now seen corresponding path program 68 times [2018-11-07 16:47:41,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:41,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:41,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:41,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:41,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5918 backedges. 1327 proven. 2446 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-11-07 16:47:42,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:42,451 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:42,451 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:42,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:42,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:42,451 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:42,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:42,459 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:42,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 16:47:42,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:42,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5918 backedges. 1328 proven. 2346 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-07 16:47:42,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5918 backedges. 1328 proven. 2346 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-07 16:47:44,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:44,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 43 [2018-11-07 16:47:44,179 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:44,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 16:47:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 16:47:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1091, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 16:47:44,181 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 43 states. [2018-11-07 16:47:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:44,685 INFO L93 Difference]: Finished difference Result 369 states and 370 transitions. [2018-11-07 16:47:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 16:47:44,686 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 356 [2018-11-07 16:47:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:44,688 INFO L225 Difference]: With dead ends: 369 [2018-11-07 16:47:44,688 INFO L226 Difference]: Without dead ends: 367 [2018-11-07 16:47:44,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 676 SyntacticMatches, 71 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=728, Invalid=1252, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:47:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-07 16:47:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-11-07 16:47:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-07 16:47:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-11-07 16:47:44,700 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 356 [2018-11-07 16:47:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:44,700 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-11-07 16:47:44,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 16:47:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-11-07 16:47:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-07 16:47:44,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:44,702 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:44,702 INFO L423 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:44,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash 523103057, now seen corresponding path program 69 times [2018-11-07 16:47:44,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:44,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:44,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:44,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:44,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2555 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:47:46,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:46,495 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:46,495 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:46,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:46,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:46,495 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:46,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:46,504 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:46,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:46,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:46,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2555 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:47:48,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2555 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:47:50,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:50,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 111 [2018-11-07 16:47:50,732 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:50,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-11-07 16:47:50,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-11-07 16:47:50,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2811, Invalid=9399, Unknown=0, NotChecked=0, Total=12210 [2018-11-07 16:47:50,734 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 111 states. [2018-11-07 16:47:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:53,381 INFO L93 Difference]: Finished difference Result 522 states and 559 transitions. [2018-11-07 16:47:53,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-07 16:47:53,381 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 364 [2018-11-07 16:47:53,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:53,382 INFO L225 Difference]: With dead ends: 522 [2018-11-07 16:47:53,383 INFO L226 Difference]: Without dead ends: 369 [2018-11-07 16:47:53,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 621 SyntacticMatches, 72 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8927 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4957, Invalid=16799, Unknown=0, NotChecked=0, Total=21756 [2018-11-07 16:47:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-07 16:47:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-11-07 16:47:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-07 16:47:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-11-07 16:47:53,402 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 364 [2018-11-07 16:47:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:53,402 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-11-07 16:47:53,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-11-07 16:47:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-11-07 16:47:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-11-07 16:47:53,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:53,405 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:53,405 INFO L423 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:53,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:53,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1568580491, now seen corresponding path program 70 times [2018-11-07 16:47:53,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:53,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:53,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:53,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:53,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6267 backedges. 1401 proven. 2588 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-11-07 16:47:54,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:54,562 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:54,562 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:54,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:54,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:54,562 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:54,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:54,570 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:54,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6267 backedges. 1402 proven. 2485 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:47:54,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6267 backedges. 1402 proven. 2485 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-07 16:47:55,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:55,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 44 [2018-11-07 16:47:55,949 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:55,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 16:47:55,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 16:47:55,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=1139, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:47:55,950 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 44 states. [2018-11-07 16:47:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:56,442 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2018-11-07 16:47:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:47:56,442 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 366 [2018-11-07 16:47:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:56,445 INFO L225 Difference]: With dead ends: 379 [2018-11-07 16:47:56,445 INFO L226 Difference]: Without dead ends: 377 [2018-11-07 16:47:56,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 695 SyntacticMatches, 73 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=766, Invalid=1304, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:47:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-11-07 16:47:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-11-07 16:47:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-07 16:47:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-11-07 16:47:56,462 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 366 [2018-11-07 16:47:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:56,462 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-11-07 16:47:56,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 16:47:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-11-07 16:47:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-11-07 16:47:56,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:56,464 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:56,464 INFO L423 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:56,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash -904094289, now seen corresponding path program 71 times [2018-11-07 16:47:56,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:56,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:56,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2700 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-07 16:47:58,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:58,266 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:58,266 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:58,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:58,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:58,266 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:58,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:58,297 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:58,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-11-07 16:47:58,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:58,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2700 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-07 16:48:00,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2700 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-07 16:48:02,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:02,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 114 [2018-11-07 16:48:02,461 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:02,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-11-07 16:48:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-11-07 16:48:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2963, Invalid=9919, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 16:48:02,463 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 114 states. [2018-11-07 16:48:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:05,409 INFO L93 Difference]: Finished difference Result 536 states and 574 transitions. [2018-11-07 16:48:05,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-07 16:48:05,409 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 374 [2018-11-07 16:48:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:05,410 INFO L225 Difference]: With dead ends: 536 [2018-11-07 16:48:05,410 INFO L226 Difference]: Without dead ends: 379 [2018-11-07 16:48:05,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 638 SyntacticMatches, 74 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9434 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5224, Invalid=17728, Unknown=0, NotChecked=0, Total=22952 [2018-11-07 16:48:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-07 16:48:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-07 16:48:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 16:48:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-11-07 16:48:05,424 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 374 [2018-11-07 16:48:05,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:05,424 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-11-07 16:48:05,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-11-07 16:48:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-11-07 16:48:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-11-07 16:48:05,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:05,426 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:05,426 INFO L423 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:05,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2135435927, now seen corresponding path program 72 times [2018-11-07 16:48:05,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:05,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:05,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:05,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:05,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 1477 proven. 2734 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-11-07 16:48:06,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:06,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:06,186 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:06,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:06,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:06,186 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:06,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:06,195 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:06,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:06,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:06,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 1478 proven. 2628 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-07 16:48:06,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 1478 proven. 2628 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-07 16:48:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 45 [2018-11-07 16:48:07,736 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:07,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 16:48:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 16:48:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=1188, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:48:07,737 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 45 states. [2018-11-07 16:48:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:08,259 INFO L93 Difference]: Finished difference Result 389 states and 390 transitions. [2018-11-07 16:48:08,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 16:48:08,260 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 376 [2018-11-07 16:48:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:08,262 INFO L225 Difference]: With dead ends: 389 [2018-11-07 16:48:08,263 INFO L226 Difference]: Without dead ends: 387 [2018-11-07 16:48:08,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 714 SyntacticMatches, 75 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1669 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=805, Invalid=1357, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 16:48:08,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-07 16:48:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-11-07 16:48:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-07 16:48:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-11-07 16:48:08,275 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 376 [2018-11-07 16:48:08,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:08,275 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-11-07 16:48:08,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 16:48:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-11-07 16:48:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-11-07 16:48:08,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:08,277 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:08,278 INFO L423 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:08,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1357713805, now seen corresponding path program 73 times [2018-11-07 16:48:08,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:08,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:08,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:08,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:08,279 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6919 backedges. 2849 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:48:10,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:10,548 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:10,548 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:10,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:10,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:10,548 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:10,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:10,557 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:10,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6919 backedges. 2849 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:48:12,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6919 backedges. 2849 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-07 16:48:15,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:15,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 117 [2018-11-07 16:48:15,243 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:15,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-11-07 16:48:15,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-11-07 16:48:15,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3119, Invalid=10453, Unknown=0, NotChecked=0, Total=13572 [2018-11-07 16:48:15,245 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 117 states. Received shutdown request... [2018-11-07 16:48:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 16:48:17,481 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:48:17,486 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:48:17,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:48:17 BoogieIcfgContainer [2018-11-07 16:48:17,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:48:17,487 INFO L168 Benchmark]: Toolchain (without parser) took 228717.15 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -836.2 MB). Peak memory consumption was 192.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:48:17,488 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:48:17,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:48:17,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:48:17,489 INFO L168 Benchmark]: Boogie Preprocessor took 20.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:48:17,489 INFO L168 Benchmark]: RCFGBuilder took 387.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:48:17,490 INFO L168 Benchmark]: TraceAbstraction took 227998.86 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 278.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -43.8 MB). Peak memory consumption was 235.1 MB. Max. memory is 7.1 GB. [2018-11-07 16:48:17,492 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 279.74 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 25.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.51 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 387.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227998.86 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 278.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -43.8 MB). Peak memory consumption was 235.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (387states) and FLOYD_HOARE automaton (currently 70 states, 117 states before enhancement),while ReachableStatesComputation was computing reachable states (319 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. TIMEOUT Result, 227.9s OverallTime, 76 OverallIterations, 38 TraceHistogramMax, 67.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3826 SDtfs, 2935 SDslu, 43368 SDs, 0 SdLazy, 52419 SolverSat, 3560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33598 GetRequests, 26653 SyntacticMatches, 2920 SemanticMatches, 4025 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153402 ImplicationChecksByTransitivity, 156.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 75 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 148.2s InterpolantComputationTime, 29611 NumberOfCodeBlocks, 29611 NumberOfCodeBlocksAsserted, 629 NumberOfCheckSat, 44173 ConstructedInterpolants, 0 QuantifiedInterpolants, 30896137 SizeOfPredicates, 220 NumberOfNonLiveVariables, 31374 ConjunctsInSsa, 3174 ConjunctsInUnsatCore, 222 InterpolantComputations, 3 PerfectInterpolantSequences, 363149/519143 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown