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_label53_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:20:59,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:20:59,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:20:59,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:20:59,651 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:20:59,652 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:20:59,653 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:20:59,655 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:20:59,657 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:20:59,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:20:59,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:20:59,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:20:59,660 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:20:59,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:20:59,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:20:59,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:20:59,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:20:59,665 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:20:59,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:20:59,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:20:59,670 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:20:59,671 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:20:59,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:20:59,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:20:59,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:20:59,675 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:20:59,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:20:59,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:20:59,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:20:59,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:20:59,679 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:20:59,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:20:59,680 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:20:59,680 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:20:59,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:20:59,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:20:59,682 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:20:59,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:20:59,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:20:59,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:20:59,699 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:20:59,700 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:20:59,700 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:20:59,700 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:20:59,700 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:20:59,700 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:20:59,701 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:20:59,701 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:20:59,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:20:59,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:20:59,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:20:59,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:20:59,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:20:59,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:20:59,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:20:59,704 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:20:59,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:20:59,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:20:59,705 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:20:59,705 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:20:59,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:20:59,705 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:20:59,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:20:59,705 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:20:59,706 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:20:59,706 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:20:59,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:20:59,706 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:20:59,706 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:20:59,707 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:20:59,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:20:59,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:20:59,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:20:59,795 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:20:59,795 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:20:59,796 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-09-10 10:21:00,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ff111aa/a69338d4ab2e499c96aae1fa26e9fffe/FLAG5f2eb6f4a [2018-09-10 10:21:00,437 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:21:00,437 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-09-10 10:21:00,460 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ff111aa/a69338d4ab2e499c96aae1fa26e9fffe/FLAG5f2eb6f4a [2018-09-10 10:21:00,484 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ff111aa/a69338d4ab2e499c96aae1fa26e9fffe [2018-09-10 10:21:00,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:21:00,500 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:21:00,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:21:00,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:21:00,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:21:00,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:21:00" (1/1) ... [2018-09-10 10:21:00,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674bafe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:00, skipping insertion in model container [2018-09-10 10:21:00,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:21:00" (1/1) ... [2018-09-10 10:21:00,758 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:21:01,062 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:21:01,083 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:21:01,251 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:21:01,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01 WrapperNode [2018-09-10 10:21:01,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:21:01,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:21:01,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:21:01,304 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:21:01,314 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:21:01" (1/1) ... [2018-09-10 10:21:01,344 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:21:01" (1/1) ... [2018-09-10 10:21:01,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:21:01,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:21:01,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:21:01,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:21:01,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01" (1/1) ... [2018-09-10 10:21:01,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01" (1/1) ... [2018-09-10 10:21:01,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01" (1/1) ... [2018-09-10 10:21:01,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01" (1/1) ... [2018-09-10 10:21:01,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01" (1/1) ... [2018-09-10 10:21:01,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01" (1/1) ... [2018-09-10 10:21:01,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01" (1/1) ... [2018-09-10 10:21:01,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:21:01,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:21:01,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:21:01,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:21:01,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01" (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:21:01,744 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:21:01,745 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:21:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:21:01,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:21:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:21:01,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:21:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:21:01,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:21:05,048 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:21:05,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:21:05 BoogieIcfgContainer [2018-09-10 10:21:05,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:21:05,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:21:05,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:21:05,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:21:05,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:21:00" (1/3) ... [2018-09-10 10:21:05,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e158ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:21:05, skipping insertion in model container [2018-09-10 10:21:05,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:21:01" (2/3) ... [2018-09-10 10:21:05,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e158ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:21:05, skipping insertion in model container [2018-09-10 10:21:05,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:21:05" (3/3) ... [2018-09-10 10:21:05,064 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label53_true-unreach-call_false-termination.c [2018-09-10 10:21:05,074 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:21:05,084 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:21:05,140 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:21:05,141 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:21:05,142 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:21:05,142 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:21:05,142 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:21:05,142 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:21:05,142 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:21:05,143 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:21:05,143 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:21:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-09-10 10:21:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-10 10:21:05,194 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:05,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:05,197 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:21:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1411619059, now seen corresponding path program 1 times [2018-09-10 10:21:05,204 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:05,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:05,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:05,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:05,251 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:05,838 WARN L175 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:21:05,996 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:21:05,999 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:06,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:21:06,000 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:06,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:21:06,026 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:21:06,027 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:21:06,029 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-09-10 10:21:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:07,890 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-09-10 10:21:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:21:07,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-09-10 10:21:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:07,910 INFO L225 Difference]: With dead ends: 550 [2018-09-10 10:21:07,910 INFO L226 Difference]: Without dead ends: 340 [2018-09-10 10:21:07,917 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:21:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-10 10:21:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-09-10 10:21:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-10 10:21:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 571 transitions. [2018-09-10 10:21:08,005 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 571 transitions. Word has length 121 [2018-09-10 10:21:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:08,006 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 571 transitions. [2018-09-10 10:21:08,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:21:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 571 transitions. [2018-09-10 10:21:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-10 10:21:08,013 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:08,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:21:08,014 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:21:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash 729811372, now seen corresponding path program 1 times [2018-09-10 10:21:08,014 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:08,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:08,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:08,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:08,016 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:08,318 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:21:08,319 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:08,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:21:08,319 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:08,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:21:08,322 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:21:08,322 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:21:08,322 INFO L87 Difference]: Start difference. First operand 340 states and 571 transitions. Second operand 3 states. [2018-09-10 10:21:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:09,381 INFO L93 Difference]: Finished difference Result 946 states and 1655 transitions. [2018-09-10 10:21:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:21:09,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-09-10 10:21:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:09,389 INFO L225 Difference]: With dead ends: 946 [2018-09-10 10:21:09,389 INFO L226 Difference]: Without dead ends: 612 [2018-09-10 10:21:09,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:21:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-09-10 10:21:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2018-09-10 10:21:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-10 10:21:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 985 transitions. [2018-09-10 10:21:09,436 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 985 transitions. Word has length 139 [2018-09-10 10:21:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:09,437 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 985 transitions. [2018-09-10 10:21:09,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:21:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 985 transitions. [2018-09-10 10:21:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-10 10:21:09,445 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:09,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,446 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:21:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2000851014, now seen corresponding path program 1 times [2018-09-10 10:21:09,447 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:09,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:09,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:09,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:09,448 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:09,738 WARN L175 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:21:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:09,924 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:21:09,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:21:09,924 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:09,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:21:09,925 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:21:09,925 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:21:09,926 INFO L87 Difference]: Start difference. First operand 612 states and 985 transitions. Second operand 6 states. [2018-09-10 10:21:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:12,037 INFO L93 Difference]: Finished difference Result 1627 states and 2643 transitions. [2018-09-10 10:21:12,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:21:12,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-09-10 10:21:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:12,051 INFO L225 Difference]: With dead ends: 1627 [2018-09-10 10:21:12,051 INFO L226 Difference]: Without dead ends: 1021 [2018-09-10 10:21:12,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:21:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-09-10 10:21:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1011. [2018-09-10 10:21:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-09-10 10:21:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1469 transitions. [2018-09-10 10:21:12,120 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1469 transitions. Word has length 166 [2018-09-10 10:21:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:12,121 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 1469 transitions. [2018-09-10 10:21:12,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:21:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1469 transitions. [2018-09-10 10:21:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-10 10:21:12,131 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:12,131 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:21:12,132 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:21:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2069133399, now seen corresponding path program 1 times [2018-09-10 10:21:12,132 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:12,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:12,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:12,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:12,135 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:12,439 WARN L175 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:21:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:21:12,768 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:12,768 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:21:12,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:12,783 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:12,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-10 10:21:13,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:21:13,917 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:21:13,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-09-10 10:21:13,918 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:13,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:13,918 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:13,919 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:21:13,919 INFO L87 Difference]: Start difference. First operand 1011 states and 1469 transitions. Second operand 5 states. [2018-09-10 10:21:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:16,901 INFO L93 Difference]: Finished difference Result 2991 states and 4485 transitions. [2018-09-10 10:21:16,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:21:16,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2018-09-10 10:21:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:16,921 INFO L225 Difference]: With dead ends: 2991 [2018-09-10 10:21:16,921 INFO L226 Difference]: Without dead ends: 1986 [2018-09-10 10:21:16,930 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 348 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:21:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-10 10:21:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1945. [2018-09-10 10:21:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-09-10 10:21:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2727 transitions. [2018-09-10 10:21:17,032 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2727 transitions. Word has length 177 [2018-09-10 10:21:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:17,032 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 2727 transitions. [2018-09-10 10:21:17,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2727 transitions. [2018-09-10 10:21:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-10 10:21:17,041 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:17,041 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:21:17,042 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:21:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash 662492397, now seen corresponding path program 1 times [2018-09-10 10:21:17,042 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:17,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:17,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:17,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:17,043 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:17,316 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:17,316 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:21:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:17,324 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:17,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:17,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:17,746 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:17,747 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:21:17,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:17,762 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:17,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:18,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:18,286 WARN L175 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:21:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:21:18,759 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:21:18,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 7] total 9 [2018-09-10 10:21:18,760 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:18,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:21:18,762 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:21:18,762 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:21:18,762 INFO L87 Difference]: Start difference. First operand 1945 states and 2727 transitions. Second operand 5 states. [2018-09-10 10:21:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:20,065 INFO L93 Difference]: Finished difference Result 4298 states and 6127 transitions. [2018-09-10 10:21:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:21:20,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2018-09-10 10:21:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:20,081 INFO L225 Difference]: With dead ends: 4298 [2018-09-10 10:21:20,081 INFO L226 Difference]: Without dead ends: 2359 [2018-09-10 10:21:20,089 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 698 SyntacticMatches, 11 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:21:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2018-09-10 10:21:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2359. [2018-09-10 10:21:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2018-09-10 10:21:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 3314 transitions. [2018-09-10 10:21:20,205 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 3314 transitions. Word has length 178 [2018-09-10 10:21:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:20,207 INFO L480 AbstractCegarLoop]: Abstraction has 2359 states and 3314 transitions. [2018-09-10 10:21:20,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:21:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 3314 transitions. [2018-09-10 10:21:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-10 10:21:20,217 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:21:20,218 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:21:20,218 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:21:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash -855588507, now seen corresponding path program 1 times [2018-09-10 10:21:20,219 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:21:20,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:20,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:20,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:21:20,220 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:21:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:21:21,036 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:21:21,036 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:21:21,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:21:21,049 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:21:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:21:21,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:21:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-10 10:21:21,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:21:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-10 10:21:21,522 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:21:21,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2018-09-10 10:21:21,522 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:21:21,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:21:21,523 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:21:21,523 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:21:21,523 INFO L87 Difference]: Start difference. First operand 2359 states and 3314 transitions. Second operand 3 states. [2018-09-10 10:21:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:21:22,322 INFO L93 Difference]: Finished difference Result 5970 states and 8583 transitions. [2018-09-10 10:21:22,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:21:22,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-09-10 10:21:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:21:22,323 INFO L225 Difference]: With dead ends: 5970 [2018-09-10 10:21:22,324 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:21:22,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:21:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:21:22,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:21:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:21:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:21:22,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2018-09-10 10:21:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:21:22,347 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:21:22,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:21:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:21:22,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:21:22,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:21:22,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:21:22,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:21:22,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:21:22,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:21:22,597 WARN L175 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-10 10:21:23,126 WARN L175 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-09-10 10:21:24,083 WARN L175 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2018-09-10 10:21:24,266 WARN L175 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-09-10 10:21:24,439 WARN L175 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-09-10 10:21:24,441 INFO L426 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-09-10 10:21:24,441 INFO L426 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-09-10 10:21:24,442 INFO L426 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,442 INFO L426 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,442 INFO L426 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,442 INFO L426 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,442 INFO L426 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,442 INFO L426 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,442 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-09-10 10:21:24,442 INFO L426 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,443 INFO L426 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-09-10 10:21:24,444 INFO L426 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-09-10 10:21:24,445 INFO L426 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-09-10 10:21:24,445 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-09-10 10:21:24,445 INFO L426 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-09-10 10:21:24,445 INFO L426 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-09-10 10:21:24,445 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:21:24,445 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 518) no Hoare annotation was computed. [2018-09-10 10:21:24,445 INFO L426 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-09-10 10:21:24,445 INFO L426 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,445 INFO L426 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,445 INFO L426 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,446 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:21:24,446 INFO L426 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-09-10 10:21:24,446 INFO L426 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-09-10 10:21:24,447 INFO L426 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,448 INFO L426 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,449 INFO L426 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,450 INFO L426 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,450 INFO L426 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-09-10 10:21:24,450 INFO L426 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,450 INFO L426 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-09-10 10:21:24,450 INFO L426 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-09-10 10:21:24,450 INFO L426 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-09-10 10:21:24,450 INFO L426 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-09-10 10:21:24,451 INFO L426 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-09-10 10:21:24,451 INFO L426 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-09-10 10:21:24,451 INFO L426 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-09-10 10:21:24,451 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-09-10 10:21:24,451 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-09-10 10:21:24,451 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-09-10 10:21:24,451 INFO L426 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-09-10 10:21:24,451 INFO L426 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-09-10 10:21:24,452 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-09-10 10:21:24,452 INFO L426 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,452 INFO L426 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,452 INFO L426 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,452 INFO L426 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,452 INFO L426 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,452 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-09-10 10:21:24,452 INFO L426 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-09-10 10:21:24,452 INFO L426 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-09-10 10:21:24,453 INFO L426 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-09-10 10:21:24,453 INFO L426 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-09-10 10:21:24,453 INFO L426 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-09-10 10:21:24,453 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-09-10 10:21:24,453 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-09-10 10:21:24,453 INFO L426 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,453 INFO L426 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,453 INFO L426 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,454 INFO L426 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,454 INFO L426 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,454 INFO L426 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-09-10 10:21:24,454 INFO L426 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-09-10 10:21:24,454 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-09-10 10:21:24,454 INFO L426 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-09-10 10:21:24,454 INFO L426 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-09-10 10:21:24,454 INFO L426 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-09-10 10:21:24,454 INFO L426 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-09-10 10:21:24,455 INFO L426 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-09-10 10:21:24,455 INFO L426 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-09-10 10:21:24,455 INFO L426 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-09-10 10:21:24,455 INFO L426 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-09-10 10:21:24,455 INFO L426 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,455 INFO L426 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,455 INFO L426 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,455 INFO L426 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-09-10 10:21:24,456 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-09-10 10:21:24,457 INFO L426 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-09-10 10:21:24,458 INFO L426 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-09-10 10:21:24,458 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-09-10 10:21:24,458 INFO L426 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-09-10 10:21:24,458 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-09-10 10:21:24,458 INFO L426 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-09-10 10:21:24,458 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-09-10 10:21:24,458 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-09-10 10:21:24,458 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 ((.cse6 (= |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)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)|)) (.cse11 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (let ((.cse10 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13)) (.cse0 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1))) (.cse3 (and .cse6 .cse7 .cse9 .cse11)) (.cse5 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 14)) (.cse8 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1))) (.cse1 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)|)) (.cse2 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1))) (.cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9)) (or .cse10 .cse2 .cse5 (and .cse6 .cse9 .cse11)) (or .cse10 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse1 .cse5 .cse7) (or .cse0 .cse2 .cse3 .cse5) (or .cse1 .cse5 (and .cse6 (or (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) .cse9)) (or (and .cse6 .cse8 .cse9 .cse11) .cse1 .cse2 .cse4)))) [2018-09-10 10:21:24,459 INFO L426 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,459 INFO L426 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,459 INFO L426 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,459 INFO L426 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,459 INFO L426 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,459 INFO L426 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:21:24,459 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-09-10 10:21:24,459 INFO L426 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-09-10 10:21:24,459 INFO L426 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L426 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L426 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L426 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L426 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:21:24,460 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) (or (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 |old(~__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:21:24,460 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:21:24,460 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 14)) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)) [2018-09-10 10:21:24,460 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:21:24,461 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:21:24,461 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 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)|) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 14) (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) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)|) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) [2018-09-10 10:21:24,461 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:21:24,461 INFO L422 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1))) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 14))) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (and .cse0 .cse1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 14) (and .cse0 .cse2 .cse3) (and .cse4 .cse1 .cse3) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (and .cse4 .cse2 .cse1) (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)|) (and .cse0 .cse4 .cse3) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) .cse1 .cse3))) [2018-09-10 10:21:24,461 INFO L426 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-09-10 10:21:24,461 INFO L426 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-09-10 10:21:24,461 INFO L426 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-09-10 10:21:24,461 INFO L422 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1))) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 14))) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (and .cse0 .cse1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 14) (and .cse0 .cse2 .cse3) (and .cse4 .cse1 .cse3) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (and .cse4 .cse2 .cse1) (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)|) (and .cse0 .cse4 .cse3) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) .cse1 .cse3))) [2018-09-10 10:21:24,462 INFO L426 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:21:24,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:21:24 BoogieIcfgContainer [2018-09-10 10:21:24,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:21:24,482 INFO L168 Benchmark]: Toolchain (without parser) took 23984.24 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.0 GB in the end (delta: -531.2 MB). Peak memory consumption was 542.5 MB. Max. memory is 7.1 GB. [2018-09-10 10:21:24,483 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:21:24,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.94 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:21:24,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.36 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:21:24,487 INFO L168 Benchmark]: Boogie Preprocessor took 234.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -846.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:21:24,488 INFO L168 Benchmark]: RCFGBuilder took 3388.36 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: 124.1 MB). Peak memory consumption was 124.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:21:24,489 INFO L168 Benchmark]: TraceAbstraction took 19430.14 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 324.5 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 148.8 MB). Peak memory consumption was 473.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:21:24,493 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.94 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 122.36 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 234.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -846.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3388.36 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: 124.1 MB). Peak memory consumption was 124.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19430.14 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 324.5 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 148.8 MB). Peak memory consumption was 473.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: 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__a16 <= 5 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14))) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) == 1)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8) == 14) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 <= 5 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20) == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14))) || 5 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 <= 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || ((!(__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__a8 == 14)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 19.3s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 783 SDtfs, 2499 SDslu, 381 SDs, 0 SdLazy, 3548 SolverSat, 904 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1473 GetRequests, 1417 SyntacticMatches, 19 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2359occurred in iteration=5, 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, 6 MinimizatonAttempts, 51 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 63 PreInvPairs, 105 NumberOfFragments, 412 HoareAnnotationTreeSize, 63 FomulaSimplifications, 1220 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 723 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1678 NumberOfCodeBlocks, 1678 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2379 ConstructedInterpolants, 0 QuantifiedInterpolants, 1365101 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1874 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 737/768 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_label53_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-21-24-522.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label53_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-21-24-522.csv Received shutdown request...