java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:19:54,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:19:54,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:19:54,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:19:54,170 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:19:54,171 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:19:54,172 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:19:54,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:19:54,176 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:19:54,177 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:19:54,178 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:19:54,178 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:19:54,179 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:19:54,180 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:19:54,181 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:19:54,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:19:54,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:19:54,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:19:54,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:19:54,188 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:19:54,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:19:54,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:19:54,193 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:19:54,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:19:54,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:19:54,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:19:54,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:19:54,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:19:54,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:19:54,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:19:54,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:19:54,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:19:54,200 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:19:54,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:19:54,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:19:54,202 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:19:54,203 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-09-10 10:19:54,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:19:54,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:19:54,220 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:19:54,220 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:19:54,220 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:19:54,221 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:19:54,221 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:19:54,221 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:19:54,221 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:19:54,222 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:19:54,222 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:19:54,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:19:54,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:19:54,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:19:54,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:19:54,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:19:54,223 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:19:54,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:19:54,224 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:19:54,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:19:54,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:19:54,224 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:19:54,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:19:54,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:19:54,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:19:54,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:19:54,225 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:19:54,226 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:19:54,226 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:19:54,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:19:54,226 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:19:54,226 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:19:54,227 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:19:54,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:19:54,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:19:54,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:19:54,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:19:54,299 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:19:54,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c [2018-09-10 10:19:54,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f776d6fc5/95fa9d10fbc04eb2940ddb9b3b93903c/FLAGf4e004adf [2018-09-10 10:19:54,949 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:19:54,951 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c [2018-09-10 10:19:54,977 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f776d6fc5/95fa9d10fbc04eb2940ddb9b3b93903c/FLAGf4e004adf [2018-09-10 10:19:54,996 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f776d6fc5/95fa9d10fbc04eb2940ddb9b3b93903c [2018-09-10 10:19:55,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:19:55,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:19:55,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:19:55,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:19:55,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:19:55,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:19:54" (1/1) ... [2018-09-10 10:19:55,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c01a3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55, skipping insertion in model container [2018-09-10 10:19:55,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:19:54" (1/1) ... [2018-09-10 10:19:55,278 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:19:55,550 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:19:55,569 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:19:55,721 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:19:55,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55 WrapperNode [2018-09-10 10:19:55,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:19:55,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:19:55,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:19:55,756 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:19:55,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (1/1) ... [2018-09-10 10:19:55,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (1/1) ... [2018-09-10 10:19:55,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:19:55,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:19:55,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:19:55,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:19:56,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (1/1) ... [2018-09-10 10:19:56,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (1/1) ... [2018-09-10 10:19:56,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (1/1) ... [2018-09-10 10:19:56,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (1/1) ... [2018-09-10 10:19:56,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (1/1) ... [2018-09-10 10:19:56,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (1/1) ... [2018-09-10 10:19:56,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (1/1) ... [2018-09-10 10:19:56,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:19:56,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:19:56,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:19:56,084 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:19:56,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (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-09-10 10:19:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:19:56,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:19:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:19:56,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:19:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:19:56,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:19:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:19:56,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:19:59,565 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:19:59,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:19:59 BoogieIcfgContainer [2018-09-10 10:19:59,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:19:59,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:19:59,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:19:59,571 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:19:59,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:19:54" (1/3) ... [2018-09-10 10:19:59,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cf6319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:19:59, skipping insertion in model container [2018-09-10 10:19:59,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:19:55" (2/3) ... [2018-09-10 10:19:59,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cf6319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:19:59, skipping insertion in model container [2018-09-10 10:19:59,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:19:59" (3/3) ... [2018-09-10 10:19:59,575 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label26_true-unreach-call_false-termination.c [2018-09-10 10:19:59,586 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:19:59,597 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:19:59,655 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:19:59,656 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:19:59,656 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:19:59,656 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:19:59,656 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:19:59,657 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:19:59,657 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:19:59,657 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:19:59,657 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:19:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-09-10 10:19:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-10 10:19:59,697 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:19:59,698 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:19:59,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:19:59,705 INFO L82 PathProgramCache]: Analyzing trace with hash 478590752, now seen corresponding path program 1 times [2018-09-10 10:19:59,708 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:19:59,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:19:59,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:59,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:19:59,765 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:19:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:00,312 WARN L175 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:20:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:00,458 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:00,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:20:00,459 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:00,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:20:00,485 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:20:00,485 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:20:00,489 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-09-10 10:20:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:02,039 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-09-10 10:20:02,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:20:02,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-09-10 10:20:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:02,066 INFO L225 Difference]: With dead ends: 550 [2018-09-10 10:20:02,066 INFO L226 Difference]: Without dead ends: 340 [2018-09-10 10:20:02,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:20:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-10 10:20:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-09-10 10:20:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-10 10:20:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-09-10 10:20:02,161 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 110 [2018-09-10 10:20:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:02,162 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-09-10 10:20:02,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:20:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-09-10 10:20:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-10 10:20:02,170 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:02,171 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:02,171 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:20:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2135344451, now seen corresponding path program 1 times [2018-09-10 10:20:02,172 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:02,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:02,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:02,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:02,174 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:02,357 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:02,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:20:02,357 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:02,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:20:02,360 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:20:02,360 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:20:02,360 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-09-10 10:20:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:04,389 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-09-10 10:20:04,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:20:04,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-09-10 10:20:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:04,397 INFO L225 Difference]: With dead ends: 888 [2018-09-10 10:20:04,397 INFO L226 Difference]: Without dead ends: 554 [2018-09-10 10:20:04,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:20:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-09-10 10:20:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-09-10 10:20:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-09-10 10:20:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-09-10 10:20:04,437 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 121 [2018-09-10 10:20:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:04,437 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-09-10 10:20:04,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:20:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-09-10 10:20:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-10 10:20:04,443 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:04,443 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:04,443 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:20:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1570877101, now seen corresponding path program 1 times [2018-09-10 10:20:04,444 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:04,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:04,445 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:04,967 WARN L175 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-10 10:20:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:05,095 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:05,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:20:05,095 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:05,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:20:05,096 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:20:05,096 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:20:05,097 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-09-10 10:20:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:06,875 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-09-10 10:20:06,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:20:06,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-09-10 10:20:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:06,882 INFO L225 Difference]: With dead ends: 1210 [2018-09-10 10:20:06,883 INFO L226 Difference]: Without dead ends: 536 [2018-09-10 10:20:06,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:20:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-09-10 10:20:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-09-10 10:20:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-09-10 10:20:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-09-10 10:20:06,925 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 122 [2018-09-10 10:20:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:06,926 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-09-10 10:20:06,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:20:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-09-10 10:20:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-10 10:20:06,932 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:06,932 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:06,932 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:20:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash -903621895, now seen corresponding path program 1 times [2018-09-10 10:20:06,934 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:06,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:06,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:06,936 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:07,392 WARN L175 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-09-10 10:20:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:07,484 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:07,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:20:07,484 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:07,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:20:07,485 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:20:07,485 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:20:07,486 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-09-10 10:20:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:09,831 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-09-10 10:20:09,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:20:09,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2018-09-10 10:20:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:09,837 INFO L225 Difference]: With dead ends: 1204 [2018-09-10 10:20:09,837 INFO L226 Difference]: Without dead ends: 535 [2018-09-10 10:20:09,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:20:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-09-10 10:20:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-09-10 10:20:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-09-10 10:20:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-09-10 10:20:09,860 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 123 [2018-09-10 10:20:09,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:09,861 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-09-10 10:20:09,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:20:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-09-10 10:20:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-10 10:20:09,863 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:09,864 INFO L376 BasicCegarLoop]: trace histogram [2, 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, 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, 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, 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-09-10 10:20:09,864 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:20:09,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972359, now seen corresponding path program 1 times [2018-09-10 10:20:09,864 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:09,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:09,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:09,866 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:10,046 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:10,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:20:10,046 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:10,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:20:10,047 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:20:10,047 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:20:10,047 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-09-10 10:20:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:10,874 INFO L93 Difference]: Finished difference Result 1516 states and 2290 transitions. [2018-09-10 10:20:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:20:10,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-09-10 10:20:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:10,882 INFO L225 Difference]: With dead ends: 1516 [2018-09-10 10:20:10,882 INFO L226 Difference]: Without dead ends: 987 [2018-09-10 10:20:10,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:20:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-09-10 10:20:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2018-09-10 10:20:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2018-09-10 10:20:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1419 transitions. [2018-09-10 10:20:10,914 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1419 transitions. Word has length 128 [2018-09-10 10:20:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:10,915 INFO L480 AbstractCegarLoop]: Abstraction has 987 states and 1419 transitions. [2018-09-10 10:20:10,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:20:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1419 transitions. [2018-09-10 10:20:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-10 10:20:10,919 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:10,919 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:10,919 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:20:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1608313079, now seen corresponding path program 1 times [2018-09-10 10:20:10,920 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:10,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:10,921 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:11,161 WARN L175 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:20:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:11,506 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:11,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:20:11,506 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:11,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:20:11,507 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:20:11,507 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:20:11,508 INFO L87 Difference]: Start difference. First operand 987 states and 1419 transitions. Second operand 6 states. [2018-09-10 10:20:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:12,847 INFO L93 Difference]: Finished difference Result 2565 states and 3794 transitions. [2018-09-10 10:20:12,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:20:12,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-09-10 10:20:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:12,858 INFO L225 Difference]: With dead ends: 2565 [2018-09-10 10:20:12,858 INFO L226 Difference]: Without dead ends: 1584 [2018-09-10 10:20:12,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:20:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2018-09-10 10:20:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1532. [2018-09-10 10:20:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1532 states. [2018-09-10 10:20:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1960 transitions. [2018-09-10 10:20:12,927 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1960 transitions. Word has length 136 [2018-09-10 10:20:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:12,928 INFO L480 AbstractCegarLoop]: Abstraction has 1532 states and 1960 transitions. [2018-09-10 10:20:12,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:20:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1960 transitions. [2018-09-10 10:20:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-10 10:20:12,933 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:12,933 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:12,934 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:20:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash -547029859, now seen corresponding path program 1 times [2018-09-10 10:20:12,934 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:12,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:12,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:12,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:12,936 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:13,128 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:13,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:20:13,129 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:13,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:20:13,134 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:20:13,134 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:20:13,135 INFO L87 Difference]: Start difference. First operand 1532 states and 1960 transitions. Second operand 3 states. [2018-09-10 10:20:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:13,920 INFO L93 Difference]: Finished difference Result 4438 states and 5839 transitions. [2018-09-10 10:20:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:20:13,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-09-10 10:20:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:13,943 INFO L225 Difference]: With dead ends: 4438 [2018-09-10 10:20:13,943 INFO L226 Difference]: Without dead ends: 2912 [2018-09-10 10:20:13,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:20:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2018-09-10 10:20:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2907. [2018-09-10 10:20:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2907 states. [2018-09-10 10:20:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 3656 transitions. [2018-09-10 10:20:14,027 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 3656 transitions. Word has length 137 [2018-09-10 10:20:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:14,028 INFO L480 AbstractCegarLoop]: Abstraction has 2907 states and 3656 transitions. [2018-09-10 10:20:14,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:20:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3656 transitions. [2018-09-10 10:20:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-10 10:20:14,040 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:20:14,041 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:20:14,041 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:20:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1593279637, now seen corresponding path program 1 times [2018-09-10 10:20:14,041 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:20:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:14,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:20:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:20:14,043 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:20:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:20:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:20:14,217 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:20:14,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:20:14,217 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:20:14,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:20:14,218 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:20:14,218 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:20:14,219 INFO L87 Difference]: Start difference. First operand 2907 states and 3656 transitions. Second operand 3 states. [2018-09-10 10:20:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:20:15,076 INFO L93 Difference]: Finished difference Result 7851 states and 10077 transitions. [2018-09-10 10:20:15,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:20:15,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-09-10 10:20:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:20:15,084 INFO L225 Difference]: With dead ends: 7851 [2018-09-10 10:20:15,084 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:20:15,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:20:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:20:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:20:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:20:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:20:15,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2018-09-10 10:20:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:20:15,114 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:20:15,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:20:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:20:15,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:20:15,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:20:15,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:15,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:15,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:15,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:15,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:15,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:20:15,409 WARN L175 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 10:20:16,592 WARN L175 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 124 DAG size of output: 55 [2018-09-10 10:20:16,985 WARN L175 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2018-09-10 10:20:16,989 INFO L426 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-09-10 10:20:16,989 INFO L426 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-09-10 10:20:16,989 INFO L426 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,989 INFO L426 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,989 INFO L426 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,990 INFO L426 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,990 INFO L426 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,990 INFO L426 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,990 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2018-09-10 10:20:16,990 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-09-10 10:20:16,990 INFO L426 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-09-10 10:20:16,990 INFO L426 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-09-10 10:20:16,991 INFO L426 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-09-10 10:20:16,991 INFO L426 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-09-10 10:20:16,991 INFO L426 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-09-10 10:20:16,991 INFO L426 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-09-10 10:20:16,991 INFO L426 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-09-10 10:20:16,991 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-09-10 10:20:16,991 INFO L426 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-09-10 10:20:16,991 INFO L426 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,992 INFO L426 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,992 INFO L426 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,992 INFO L426 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,992 INFO L426 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,992 INFO L426 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,992 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-09-10 10:20:16,992 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-09-10 10:20:16,992 INFO L426 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-09-10 10:20:16,992 INFO L426 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-09-10 10:20:16,993 INFO L426 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-09-10 10:20:16,993 INFO L426 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-09-10 10:20:16,993 INFO L426 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-09-10 10:20:16,993 INFO L426 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-09-10 10:20:16,993 INFO L426 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-09-10 10:20:16,993 INFO L426 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-09-10 10:20:16,993 INFO L426 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-09-10 10:20:16,993 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-09-10 10:20:16,993 INFO L426 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-09-10 10:20:16,994 INFO L426 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-09-10 10:20:16,994 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,994 INFO L426 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-09-10 10:20:16,994 INFO L426 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,994 INFO L426 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,994 INFO L426 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,994 INFO L426 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,994 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,994 INFO L426 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,995 INFO L426 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-09-10 10:20:16,995 INFO L426 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-09-10 10:20:16,995 INFO L426 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-09-10 10:20:16,995 INFO L426 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-09-10 10:20:16,995 INFO L426 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-09-10 10:20:16,995 INFO L426 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-09-10 10:20:16,995 INFO L426 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-09-10 10:20:16,995 INFO L426 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-09-10 10:20:16,995 INFO L426 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-09-10 10:20:16,996 INFO L426 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,996 INFO L426 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,996 INFO L426 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,996 INFO L426 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,996 INFO L426 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,996 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-09-10 10:20:16,996 INFO L426 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-09-10 10:20:16,996 INFO L426 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-09-10 10:20:16,997 INFO L426 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-09-10 10:20:16,997 INFO L426 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-09-10 10:20:16,997 INFO L426 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-09-10 10:20:16,997 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-09-10 10:20:16,997 INFO L426 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-09-10 10:20:16,997 INFO L426 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-09-10 10:20:16,997 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-09-10 10:20:16,997 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-09-10 10:20:16,997 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-09-10 10:20:16,998 INFO L426 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-09-10 10:20:16,998 INFO L426 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,998 INFO L426 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,998 INFO L426 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,998 INFO L426 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,998 INFO L426 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,998 INFO L426 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-09-10 10:20:16,998 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-09-10 10:20:16,998 INFO L426 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-09-10 10:20:16,999 INFO L426 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-09-10 10:20:16,999 INFO L426 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-09-10 10:20:16,999 INFO L426 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-09-10 10:20:16,999 INFO L426 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-09-10 10:20:16,999 INFO L426 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-09-10 10:20:16,999 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-09-10 10:20:16,999 INFO L426 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:16,999 INFO L426 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,000 INFO L426 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,000 INFO L426 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,000 INFO L426 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-09-10 10:20:17,000 INFO L426 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,000 INFO L426 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-09-10 10:20:17,000 INFO L426 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-09-10 10:20:17,000 INFO L426 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-09-10 10:20:17,000 INFO L426 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-09-10 10:20:17,001 INFO L426 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-09-10 10:20:17,001 INFO L426 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-09-10 10:20:17,001 INFO L426 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-09-10 10:20:17,001 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-09-10 10:20:17,001 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-09-10 10:20:17,001 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-09-10 10:20:17,001 INFO L426 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-09-10 10:20:17,001 INFO L426 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-09-10 10:20:17,001 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-09-10 10:20:17,002 INFO L426 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,002 INFO L426 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,002 INFO L426 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,002 INFO L426 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,002 INFO L426 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,002 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-09-10 10:20:17,002 INFO L426 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-09-10 10:20:17,002 INFO L426 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-09-10 10:20:17,002 INFO L426 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,003 INFO L426 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-09-10 10:20:17,004 INFO L426 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-09-10 10:20:17,004 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-09-10 10:20:17,004 INFO L426 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-09-10 10:20:17,004 INFO L426 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-09-10 10:20:17,004 INFO L426 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-09-10 10:20:17,004 INFO L426 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-09-10 10:20:17,004 INFO L426 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-09-10 10:20:17,004 INFO L426 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-09-10 10:20:17,004 INFO L426 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-09-10 10:20:17,005 INFO L426 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-09-10 10:20:17,006 INFO L426 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-09-10 10:20:17,006 INFO L426 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-09-10 10:20:17,006 INFO L426 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-09-10 10:20:17,006 INFO L426 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-09-10 10:20:17,006 INFO L426 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-09-10 10:20:17,006 INFO L426 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-09-10 10:20:17,006 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-09-10 10:20:17,006 INFO L426 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-09-10 10:20:17,006 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-09-10 10:20:17,007 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-09-10 10:20:17,007 INFO L426 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,007 INFO L426 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,007 INFO L426 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,007 INFO L426 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,007 INFO L426 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,007 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-09-10 10:20:17,007 INFO L426 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,007 INFO L426 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-09-10 10:20:17,008 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-09-10 10:20:17,009 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-09-10 10:20:17,009 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)) (.cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (.cse13 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)) (.cse14 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (let ((.cse4 (and .cse13 .cse14)) (.cse5 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 15)) (.cse7 (not .cse2)) (.cse8 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13))) (.cse9 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1))) (.cse10 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1))) (.cse11 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 4))) (.cse6 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)) (.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1)) (.cse0 (not .cse12)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse1) (or .cse1 .cse4 .cse3) (or .cse6 .cse7 (not .cse3) .cse8 .cse9 .cse1 .cse10 .cse11) (or .cse0 .cse5 .cse1 .cse2) (or .cse7 .cse8 .cse9 .cse1 .cse10 .cse11 (and .cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (or (not .cse6) .cse1 .cse3) (or (and .cse0 .cse13 .cse14) .cse1 .cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6))))) [2018-09-10 10:20:17,009 INFO L426 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-09-10 10:20:17,010 INFO L426 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-09-10 10:20:17,011 INFO L426 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-09-10 10:20:17,011 INFO L426 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-09-10 10:20:17,011 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-09-10 10:20:17,011 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-09-10 10:20:17,011 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-09-10 10:20:17,011 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:20:17,011 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) [2018-09-10 10:20:17,011 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:20:17,011 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:20:17,012 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4))) [2018-09-10 10:20:17,012 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:20:17,012 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:20:17,012 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 4) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) [2018-09-10 10:20:17,012 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:20:17,012 INFO L422 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 4) (and (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6))) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1)) [2018-09-10 10:20:17,013 INFO L426 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-09-10 10:20:17,013 INFO L426 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-09-10 10:20:17,013 INFO L426 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-09-10 10:20:17,013 INFO L422 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 4) (and (not (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6))) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1)) [2018-09-10 10:20:17,013 INFO L426 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:20:17,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:20:17 BoogieIcfgContainer [2018-09-10 10:20:17,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:20:17,032 INFO L168 Benchmark]: Toolchain (without parser) took 22022.64 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -724.8 MB). Peak memory consumption was 376.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:17,034 INFO L168 Benchmark]: CDTParser took 0.20 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-09-10 10:20:17,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.53 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:17,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.08 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-09-10 10:20:17,038 INFO L168 Benchmark]: Boogie Preprocessor took 215.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -846.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:17,039 INFO L168 Benchmark]: RCFGBuilder took 3482.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 121.3 MB). Peak memory consumption was 121.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:17,040 INFO L168 Benchmark]: TraceAbstraction took 17462.95 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 351.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -42.0 MB). Peak memory consumption was 309.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:20:17,052 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.20 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 737.53 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 112.08 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 Preprocessor took 215.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -846.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3482.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 121.3 MB). Peak memory consumption was 121.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17462.95 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 351.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -42.0 MB). Peak memory consumption was 309.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: 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: 583]: Loop Invariant Derived loop invariant: ((((((\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8) == 13 || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8)) || !(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7)) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) == 4) || (!(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6))) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) == 6) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7) == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 17.3s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1177 SDtfs, 3267 SDslu, 484 SDs, 0 SdLazy, 4324 SolverSat, 1015 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2907occurred in iteration=7, 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 72 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 85 PreInvPairs, 153 NumberOfFragments, 286 HoareAnnotationTreeSize, 85 FomulaSimplifications, 2492 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1782 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1051 NumberOfCodeBlocks, 1051 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1043 ConstructedInterpolants, 0 QuantifiedInterpolants, 819428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 150/150 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/Problem01_label26_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-20-17-081.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label26_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-20-17-081.csv Received shutdown request...