java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 10:54:29,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 10:54:29,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 10:54:29,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 10:54:29,125 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 10:54:29,126 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 10:54:29,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 10:54:29,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 10:54:29,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 10:54:29,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 10:54:29,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 10:54:29,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 10:54:29,134 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 10:54:29,135 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 10:54:29,136 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 10:54:29,137 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 10:54:29,138 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 10:54:29,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 10:54:29,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 10:54:29,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 10:54:29,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 10:54:29,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 10:54:29,148 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 10:54:29,148 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 10:54:29,149 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 10:54:29,150 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 10:54:29,151 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 10:54:29,151 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 10:54:29,152 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 10:54:29,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 10:54:29,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 10:54:29,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 10:54:29,158 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 10:54:29,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 10:54:29,162 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 10:54:29,163 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 10:54:29,163 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 10:54:29,187 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 10:54:29,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 10:54:29,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 10:54:29,189 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 10:54:29,189 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 10:54:29,189 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 10:54:29,192 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 10:54:29,192 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 10:54:29,193 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 10:54:29,193 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 10:54:29,193 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 10:54:29,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 10:54:29,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 10:54:29,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 10:54:29,195 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 10:54:29,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 10:54:29,195 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 10:54:29,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 10:54:29,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 10:54:29,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 10:54:29,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 10:54:29,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 10:54:29,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 10:54:29,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 10:54:29,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 10:54:29,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 10:54:29,199 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 10:54:29,199 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 10:54:29,199 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 10:54:29,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 10:54:29,200 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 10:54:29,200 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 10:54:29,200 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 10:54:29,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 10:54:29,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 10:54:29,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 10:54:29,280 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 10:54:29,281 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 10:54:29,282 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-07-24 10:54:29,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1335594/9341cc7bf4d74ea8b50dcbcd44889cda/FLAGf25e783b0 [2018-07-24 10:54:29,840 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 10:54:29,841 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-07-24 10:54:29,849 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1335594/9341cc7bf4d74ea8b50dcbcd44889cda/FLAGf25e783b0 [2018-07-24 10:54:29,865 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1335594/9341cc7bf4d74ea8b50dcbcd44889cda [2018-07-24 10:54:29,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 10:54:29,877 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 10:54:29,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 10:54:29,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 10:54:29,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 10:54:29,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 10:54:29" (1/1) ... [2018-07-24 10:54:29,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd9c32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:29, skipping insertion in model container [2018-07-24 10:54:29,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 10:54:29" (1/1) ... [2018-07-24 10:54:30,055 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 10:54:30,098 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 10:54:30,114 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 10:54:30,125 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 10:54:30,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30 WrapperNode [2018-07-24 10:54:30,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 10:54:30,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 10:54:30,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 10:54:30,141 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 10:54:30,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (1/1) ... [2018-07-24 10:54:30,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (1/1) ... [2018-07-24 10:54:30,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 10:54:30,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 10:54:30,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 10:54:30,164 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 10:54:30,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (1/1) ... [2018-07-24 10:54:30,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (1/1) ... [2018-07-24 10:54:30,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (1/1) ... [2018-07-24 10:54:30,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (1/1) ... [2018-07-24 10:54:30,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (1/1) ... [2018-07-24 10:54:30,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (1/1) ... [2018-07-24 10:54:30,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (1/1) ... [2018-07-24 10:54:30,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 10:54:30,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 10:54:30,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 10:54:30,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 10:54:30,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (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-07-24 10:54:30,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 10:54:30,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 10:54:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 10:54:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 10:54:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assert [2018-07-24 10:54:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assert [2018-07-24 10:54:30,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 10:54:30,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 10:54:30,740 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 10:54:30,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 10:54:30 BoogieIcfgContainer [2018-07-24 10:54:30,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 10:54:30,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 10:54:30,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 10:54:30,745 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 10:54:30,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 10:54:29" (1/3) ... [2018-07-24 10:54:30,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b2a937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 10:54:30, skipping insertion in model container [2018-07-24 10:54:30,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:54:30" (2/3) ... [2018-07-24 10:54:30,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b2a937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 10:54:30, skipping insertion in model container [2018-07-24 10:54:30,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 10:54:30" (3/3) ... [2018-07-24 10:54:30,749 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-07-24 10:54:30,758 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 10:54:30,768 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 10:54:30,816 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 10:54:30,817 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 10:54:30,817 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 10:54:30,817 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 10:54:30,818 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 10:54:30,818 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 10:54:30,818 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 10:54:30,818 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 10:54:30,818 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 10:54:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-07-24 10:54:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-24 10:54:30,841 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:30,842 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:30,843 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:30,848 INFO L82 PathProgramCache]: Analyzing trace with hash 162908914, now seen corresponding path program 1 times [2018-07-24 10:54:30,850 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:30,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:30,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:30,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:30,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:54:30,979 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 10:54:30,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 10:54:30,979 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:54:30,984 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-24 10:54:30,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-24 10:54:30,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-24 10:54:31,000 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-07-24 10:54:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:31,026 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-07-24 10:54:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-24 10:54:31,027 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-07-24 10:54:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:31,039 INFO L225 Difference]: With dead ends: 63 [2018-07-24 10:54:31,039 INFO L226 Difference]: Without dead ends: 30 [2018-07-24 10:54:31,044 INFO L573 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-07-24 10:54:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-24 10:54:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-24 10:54:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-24 10:54:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-07-24 10:54:31,093 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 14 [2018-07-24 10:54:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:31,094 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-07-24 10:54:31,094 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-24 10:54:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-07-24 10:54:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-24 10:54:31,096 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:31,097 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:31,097 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash -685241696, now seen corresponding path program 1 times [2018-07-24 10:54:31,098 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:31,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:31,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:31,101 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:54:31,226 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 10:54:31,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 10:54:31,227 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:54:31,229 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 10:54:31,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 10:54:31,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-24 10:54:31,230 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2018-07-24 10:54:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:31,487 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-07-24 10:54:31,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 10:54:31,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-07-24 10:54:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:31,489 INFO L225 Difference]: With dead ends: 36 [2018-07-24 10:54:31,490 INFO L226 Difference]: Without dead ends: 34 [2018-07-24 10:54:31,491 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-24 10:54:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-24 10:54:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-24 10:54:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-24 10:54:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-07-24 10:54:31,502 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2018-07-24 10:54:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:31,503 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-07-24 10:54:31,503 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 10:54:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-07-24 10:54:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-24 10:54:31,504 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:31,504 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:31,504 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1726686555, now seen corresponding path program 1 times [2018-07-24 10:54:31,505 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:31,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:31,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:31,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:31,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:54:31,887 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:31,887 INFO L191 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-07-24 10:54:31,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:31,902 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:54:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:31,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:54:32,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:54:32,246 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 10:54:32,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 13 [2018-07-24 10:54:32,247 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:54:32,247 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 10:54:32,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 10:54:32,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-07-24 10:54:32,249 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2018-07-24 10:54:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:32,451 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-07-24 10:54:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 10:54:32,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-07-24 10:54:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:32,454 INFO L225 Difference]: With dead ends: 50 [2018-07-24 10:54:32,455 INFO L226 Difference]: Without dead ends: 48 [2018-07-24 10:54:32,455 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-24 10:54:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-24 10:54:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-07-24 10:54:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-24 10:54:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-07-24 10:54:32,468 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 21 [2018-07-24 10:54:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:32,468 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-07-24 10:54:32,469 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 10:54:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2018-07-24 10:54:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-24 10:54:32,470 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:32,470 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:32,471 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash -775319678, now seen corresponding path program 1 times [2018-07-24 10:54:32,471 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:32,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:32,473 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-24 10:54:32,686 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:32,686 INFO L191 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-07-24 10:54:32,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:32,703 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:54:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:32,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 10:54:33,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 10:54:33,145 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 10:54:33,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 11 [2018-07-24 10:54:33,146 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:54:33,146 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 10:54:33,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 10:54:33,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-24 10:54:33,147 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 6 states. [2018-07-24 10:54:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:33,313 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-07-24 10:54:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 10:54:33,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-07-24 10:54:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:33,315 INFO L225 Difference]: With dead ends: 57 [2018-07-24 10:54:33,315 INFO L226 Difference]: Without dead ends: 55 [2018-07-24 10:54:33,316 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-24 10:54:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-24 10:54:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-07-24 10:54:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-24 10:54:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-07-24 10:54:33,327 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 29 [2018-07-24 10:54:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:33,328 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-07-24 10:54:33,328 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 10:54:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-07-24 10:54:33,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-24 10:54:33,329 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:33,330 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:33,330 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:33,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1374335814, now seen corresponding path program 1 times [2018-07-24 10:54:33,330 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:33,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:33,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:33,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-24 10:54:33,492 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:33,492 INFO L191 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-07-24 10:54:33,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:33,501 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:54:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:33,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 10:54:33,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 10:54:33,850 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 10:54:33,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 13 [2018-07-24 10:54:33,850 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:54:33,850 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 10:54:33,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 10:54:33,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-07-24 10:54:33,851 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 7 states. [2018-07-24 10:54:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:34,129 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-07-24 10:54:34,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 10:54:34,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-07-24 10:54:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:34,131 INFO L225 Difference]: With dead ends: 73 [2018-07-24 10:54:34,131 INFO L226 Difference]: Without dead ends: 66 [2018-07-24 10:54:34,132 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-24 10:54:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-24 10:54:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-07-24 10:54:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-24 10:54:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2018-07-24 10:54:34,145 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 32 [2018-07-24 10:54:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:34,145 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2018-07-24 10:54:34,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 10:54:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2018-07-24 10:54:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-24 10:54:34,146 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:34,148 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:34,149 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash -600644733, now seen corresponding path program 1 times [2018-07-24 10:54:34,149 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:34,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:34,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:34,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:34,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-24 10:54:34,380 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:34,380 INFO L191 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-07-24 10:54:34,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:34,390 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:54:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:34,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 10:54:34,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 10:54:34,634 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 10:54:34,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [10] total 17 [2018-07-24 10:54:34,634 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:54:34,634 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 10:54:34,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 10:54:34,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-07-24 10:54:34,636 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 8 states. [2018-07-24 10:54:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:34,855 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2018-07-24 10:54:34,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 10:54:34,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-07-24 10:54:34,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:34,863 INFO L225 Difference]: With dead ends: 75 [2018-07-24 10:54:34,863 INFO L226 Difference]: Without dead ends: 73 [2018-07-24 10:54:34,864 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-07-24 10:54:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-24 10:54:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-07-24 10:54:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-24 10:54:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-07-24 10:54:34,876 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 34 [2018-07-24 10:54:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:34,876 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-07-24 10:54:34,876 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 10:54:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-07-24 10:54:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-24 10:54:34,879 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:34,879 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:34,879 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:34,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1010097109, now seen corresponding path program 1 times [2018-07-24 10:54:34,880 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:34,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:34,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:34,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:34,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-07-24 10:54:35,162 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:35,162 INFO L191 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-07-24 10:54:35,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:35,170 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:54:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:35,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-07-24 10:54:35,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-07-24 10:54:35,753 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:35,753 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:54:35,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:35,771 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:54:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:35,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 10:54:36,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 10:54:36,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:54:36,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 9, 9] total 27 [2018-07-24 10:54:36,514 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:54:36,515 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-24 10:54:36,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-24 10:54:36,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2018-07-24 10:54:36,516 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 18 states. [2018-07-24 10:54:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:37,505 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2018-07-24 10:54:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-24 10:54:37,506 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-07-24 10:54:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:37,510 INFO L225 Difference]: With dead ends: 108 [2018-07-24 10:54:37,510 INFO L226 Difference]: Without dead ends: 96 [2018-07-24 10:54:37,511 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 206 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2018-07-24 10:54:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-24 10:54:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-24 10:54:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-24 10:54:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-07-24 10:54:37,539 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 58 [2018-07-24 10:54:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:37,543 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-07-24 10:54:37,543 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-24 10:54:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2018-07-24 10:54:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-24 10:54:37,545 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:37,545 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:37,545 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1553278034, now seen corresponding path program 1 times [2018-07-24 10:54:37,546 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:37,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:37,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:37,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:37,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-07-24 10:54:37,725 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:37,725 INFO L191 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-07-24 10:54:37,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:37,733 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:54:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:37,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 10:54:37,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 10:54:38,054 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:38,054 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:54:38,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:38,069 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:54:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:38,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 10:54:38,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 10:54:38,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:54:38,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 9, 9] total 16 [2018-07-24 10:54:38,292 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:54:38,292 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-24 10:54:38,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-24 10:54:38,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-07-24 10:54:38,293 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 16 states. [2018-07-24 10:54:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:38,801 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-07-24 10:54:38,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-24 10:54:38,802 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-07-24 10:54:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:38,804 INFO L225 Difference]: With dead ends: 106 [2018-07-24 10:54:38,804 INFO L226 Difference]: Without dead ends: 104 [2018-07-24 10:54:38,805 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 222 SyntacticMatches, 14 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-07-24 10:54:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-24 10:54:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-24 10:54:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-24 10:54:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2018-07-24 10:54:38,818 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 60 [2018-07-24 10:54:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:38,818 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-07-24 10:54:38,819 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-24 10:54:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2018-07-24 10:54:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-24 10:54:38,820 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:38,820 INFO L353 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:38,821 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash -483135391, now seen corresponding path program 2 times [2018-07-24 10:54:38,821 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:38,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:38,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:54:38,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:38,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 44 proven. 50 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-07-24 10:54:39,081 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:39,081 INFO L191 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-07-24 10:54:39,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:54:39,095 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:54:39,145 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:54:39,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:54:39,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 68 proven. 38 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-07-24 10:54:39,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 68 proven. 38 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-07-24 10:54:40,211 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:40,211 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:54:40,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:54:40,227 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:54:40,287 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:54:40,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:54:40,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 48 proven. 34 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-07-24 10:54:40,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 48 proven. 34 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-07-24 10:54:40,880 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:54:40,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14, 14, 13] total 32 [2018-07-24 10:54:40,881 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:54:40,881 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-24 10:54:40,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-24 10:54:40,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-07-24 10:54:40,883 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 20 states. [2018-07-24 10:54:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:41,937 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-07-24 10:54:41,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-24 10:54:41,938 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2018-07-24 10:54:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:41,940 INFO L225 Difference]: With dead ends: 115 [2018-07-24 10:54:41,941 INFO L226 Difference]: Without dead ends: 113 [2018-07-24 10:54:41,942 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 308 SyntacticMatches, 21 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=477, Invalid=1779, Unknown=0, NotChecked=0, Total=2256 [2018-07-24 10:54:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-24 10:54:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-07-24 10:54:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-24 10:54:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-07-24 10:54:41,954 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 86 [2018-07-24 10:54:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:41,955 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-07-24 10:54:41,955 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-24 10:54:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-07-24 10:54:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-24 10:54:41,957 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:41,958 INFO L353 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:41,958 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1974775475, now seen corresponding path program 2 times [2018-07-24 10:54:41,958 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:41,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:41,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:54:41,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:41,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 64 proven. 81 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-07-24 10:54:42,216 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:42,216 INFO L191 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-07-24 10:54:42,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:54:42,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:54:42,266 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:54:42,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:54:42,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 118 proven. 29 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-07-24 10:54:42,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 107 proven. 40 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-07-24 10:54:43,004 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:43,004 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:54:43,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:54:43,022 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:54:43,094 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:54:43,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:54:43,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 68 proven. 25 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-07-24 10:54:43,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 68 proven. 25 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-07-24 10:54:43,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:54:43,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 11, 10] total 26 [2018-07-24 10:54:43,404 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:54:43,405 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-24 10:54:43,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-24 10:54:43,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-07-24 10:54:43,406 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 20 states. [2018-07-24 10:54:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:44,227 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-07-24 10:54:44,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-24 10:54:44,230 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 110 [2018-07-24 10:54:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:44,230 INFO L225 Difference]: With dead ends: 108 [2018-07-24 10:54:44,231 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 10:54:44,234 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 406 SyntacticMatches, 23 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=280, Invalid=1126, Unknown=0, NotChecked=0, Total=1406 [2018-07-24 10:54:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 10:54:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 10:54:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 10:54:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 10:54:44,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-07-24 10:54:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:44,236 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 10:54:44,236 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-24 10:54:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 10:54:44,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 10:54:44,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 10:54:44,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:54:44,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:54:45,552 WARN L169 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-07-24 10:54:46,052 WARN L169 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-07-24 10:54:46,778 WARN L169 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2018-07-24 10:54:47,157 WARN L169 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2018-07-24 10:54:47,380 WARN L169 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-07-24 10:54:47,566 WARN L169 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-07-24 10:54:47,576 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-07-24 10:54:47,576 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-07-24 10:54:47,576 INFO L424 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-07-24 10:54:47,576 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-07-24 10:54:47,576 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 10:54:47,577 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 10:54:47,577 INFO L421 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-07-24 10:54:47,577 INFO L421 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-07-24 10:54:47,577 INFO L421 ceAbstractionStarter]: For program point L4''(lines 3 8) no Hoare annotation was computed. [2018-07-24 10:54:47,577 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-07-24 10:54:47,577 INFO L424 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-07-24 10:54:47,577 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_sendmail_close_angle_true_unreach_call_true_termination_i____VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-07-24 10:54:47,577 INFO L421 ceAbstractionStarter]: For program point L23(lines 23 34) no Hoare annotation was computed. [2018-07-24 10:54:47,577 INFO L421 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-07-24 10:54:47,578 INFO L417 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= 1 main_~in~0)) (.cse3 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse4 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse5) (= main_~buf~0 0)) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 2) .cse1 (<= 2 main_~buf~0))))) [2018-07-24 10:54:47,578 INFO L417 ceAbstractionStarter]: At program point L23'''(lines 23 34) the Hoare annotation is: (let ((.cse2 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (let ((.cse1 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) .cse2 .cse0 (<= .cse1 main_~bufferlen~0) .cse3)) (and (<= main_~buf~0 2) .cse2 .cse0 (<= 3 main_~inlen~0) .cse3))) [2018-07-24 10:54:47,578 INFO L421 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-07-24 10:54:47,579 INFO L417 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse2 (<= 1 main_~in~0)) (.cse4 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse3 (<= (+ main_~buf~0 3) main_~bufferlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0)) (and .cse0 .cse2 .cse3 .cse4 (<= main_~in~0 2) .cse1 (<= 2 main_~buf~0)) (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse5) (= main_~buf~0 0))))) [2018-07-24 10:54:47,579 INFO L421 ceAbstractionStarter]: For program point L23'(lines 23 34) no Hoare annotation was computed. [2018-07-24 10:54:47,579 INFO L421 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-07-24 10:54:47,579 INFO L421 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-07-24 10:54:47,579 INFO L417 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 .cse4 (<= 2 main_~buf~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse3 (<= 3 main_~buf~0) .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse2 (<= main_~in~0 1) .cse3 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-07-24 10:54:47,580 INFO L417 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 .cse4 (<= 2 main_~buf~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse3 (<= 3 main_~buf~0) .cse1 .cse2 .cse4) (and .cse0 .cse3 (<= 0 main_~in~0) .cse2 (<= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 .cse1 .cse2 (<= main_~in~0 1) .cse3 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-07-24 10:54:47,580 INFO L421 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-07-24 10:54:47,580 INFO L417 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse2 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (let ((.cse1 (+ main_~buflim~0 2))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) .cse2 .cse0 (<= .cse1 main_~bufferlen~0) .cse3)) (and (<= main_~buf~0 2) .cse2 .cse0 (<= 3 main_~inlen~0) .cse3))) [2018-07-24 10:54:47,580 INFO L421 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-07-24 10:54:47,580 INFO L424 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-07-24 10:54:47,580 INFO L417 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-07-24 10:54:47,581 INFO L421 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-07-24 10:54:47,581 INFO L417 ceAbstractionStarter]: At program point L38'(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-07-24 10:54:47,581 INFO L424 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-07-24 10:54:47,581 INFO L421 ceAbstractionStarter]: For program point L17'(lines 11 42) no Hoare annotation was computed. [2018-07-24 10:54:47,581 INFO L421 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-07-24 10:54:47,581 INFO L421 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-07-24 10:54:47,581 INFO L421 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-07-24 10:54:47,582 INFO L417 ceAbstractionStarter]: At program point L32'(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse0 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse2 (<= 1 main_~in~0)) (.cse3 (<= .cse5 main_~bufferlen~0)) (.cse1 (<= main_~bufferlen~0 .cse5))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse1 (<= 3 main_~buf~0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 (<= main_~in~0 2) .cse1 .cse4 (<= 2 main_~buf~0)) (and .cse0 .cse2 .cse3 (<= main_~in~0 1) .cse1 (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)))))) [2018-07-24 10:54:47,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 10:54:47 BoogieIcfgContainer [2018-07-24 10:54:47,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 10:54:47,596 INFO L168 Benchmark]: Toolchain (without parser) took 17719.47 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.4 GB in the end (delta: -929.6 MB). Peak memory consumption was 710.9 MB. Max. memory is 7.1 GB. [2018-07-24 10:54:47,597 INFO L168 Benchmark]: CDTParser took 0.28 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-07-24 10:54:47,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.01 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-07-24 10:54:47,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.91 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-07-24 10:54:47,599 INFO L168 Benchmark]: Boogie Preprocessor took 25.41 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-07-24 10:54:47,599 INFO L168 Benchmark]: RCFGBuilder took 551.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.2 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-07-24 10:54:47,600 INFO L168 Benchmark]: TraceAbstraction took 16853.11 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 273.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -145.0 MB). Peak memory consumption was 747.4 MB. Max. memory is 7.1 GB. [2018-07-24 10:54:47,605 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.28 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 261.01 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 22.91 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 25.41 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 551.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.2 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16853.11 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 273.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -145.0 MB). Peak memory consumption was 747.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((bufferlen + 1 <= inlen && 1 <= in) && buflim + 2 <= bufferlen) && in <= 2) && bufferlen <= buflim + 2) && buf + 2 <= bufferlen) && 2 <= buf) || ((((((bufferlen + 1 <= inlen && in + bufferlen + 1 <= buf + inlen) && bufferlen <= buflim + 2) && 3 <= buf) && 1 <= in) && buflim + 2 <= bufferlen) && buf + 2 <= bufferlen)) || ((((((bufferlen + 1 <= inlen && bufferlen <= buflim + 2) && 0 <= in) && buflim + 2 <= bufferlen) && in <= 0) && buf == 0) && 2 <= bufferlen)) || ((((((bufferlen + 1 <= inlen && 1 <= in) && buflim + 2 <= bufferlen) && in <= 1) && bufferlen <= buflim + 2) && 1 <= buf) && buf < buflim + 1) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. SAFE Result, 16.7s OverallTime, 10 OverallIterations, 16 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 384 SDtfs, 436 SDslu, 1568 SDs, 0 SdLazy, 1546 SolverSat, 453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1630 GetRequests, 1356 SyntacticMatches, 82 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1849 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 58 PreInvPairs, 100 NumberOfFragments, 768 HoareAnnotationTreeSize, 58 FomulaSimplifications, 839 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 902 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1204 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1914 ConstructedInterpolants, 0 QuantifiedInterpolants, 638836 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1453 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 34 InterpolantComputations, 10 PerfectInterpolantSequences, 4433/4988 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sendmail-close-angle_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_10-54-47-621.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sendmail-close-angle_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_10-54-47-621.csv Received shutdown request...