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/Problem02_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:22:32,443 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:22:32,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:22:32,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:22:32,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:22:32,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:22:32,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:22:32,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:22:32,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:22:32,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:22:32,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:22:32,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:22:32,469 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:22:32,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:22:32,471 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:22:32,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:22:32,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:22:32,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:22:32,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:22:32,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:22:32,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:22:32,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:22:32,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:22:32,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:22:32,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:22:32,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:22:32,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:22:32,486 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:22:32,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:22:32,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:22:32,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:22:32,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:22:32,489 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:22:32,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:22:32,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:22:32,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:22:32,491 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:22:32,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:22:32,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:22:32,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:22:32,507 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:22:32,508 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:22:32,508 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:22:32,508 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:22:32,508 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:22:32,508 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:22:32,509 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:22:32,509 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:22:32,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:22:32,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:22:32,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:22:32,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:22:32,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:22:32,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:22:32,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:22:32,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:22:32,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:22:32,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:22:32,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:22:32,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:22:32,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:22:32,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:22:32,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:22:32,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:22:32,512 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:22:32,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:22:32,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:22:32,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:22:32,513 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:22:32,513 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:22:32,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:22:32,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:22:32,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:22:32,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:22:32,603 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:22:32,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-09-10 10:22:32,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/172bba27a/458dad5fbef648aaaa2e1bde60899835/FLAG42d28c79b [2018-09-10 10:22:33,215 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:22:33,215 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-09-10 10:22:33,241 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/172bba27a/458dad5fbef648aaaa2e1bde60899835/FLAG42d28c79b [2018-09-10 10:22:33,275 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/172bba27a/458dad5fbef648aaaa2e1bde60899835 [2018-09-10 10:22:33,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:22:33,294 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:22:33,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:22:33,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:22:33,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:22:33,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:22:33" (1/1) ... [2018-09-10 10:22:33,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62bc1382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:33, skipping insertion in model container [2018-09-10 10:22:33,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:22:33" (1/1) ... [2018-09-10 10:22:33,525 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:22:33,803 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:22:33,826 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:22:33,964 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:22:34,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34 WrapperNode [2018-09-10 10:22:34,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:22:34,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:22:34,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:22:34,010 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:22:34,021 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:22:34" (1/1) ... [2018-09-10 10:22:34,051 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:22:34" (1/1) ... [2018-09-10 10:22:34,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:22:34,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:22:34,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:22:34,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:22:34,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34" (1/1) ... [2018-09-10 10:22:34,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34" (1/1) ... [2018-09-10 10:22:34,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34" (1/1) ... [2018-09-10 10:22:34,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34" (1/1) ... [2018-09-10 10:22:34,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34" (1/1) ... [2018-09-10 10:22:34,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34" (1/1) ... [2018-09-10 10:22:34,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34" (1/1) ... [2018-09-10 10:22:34,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:22:34,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:22:34,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:22:34,344 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:22:34,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34" (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:22:34,418 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:22:34,418 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:22:34,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:22:34,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:22:34,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:22:34,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:22:34,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:22:34,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:22:37,764 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:22:37,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:22:37 BoogieIcfgContainer [2018-09-10 10:22:37,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:22:37,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:22:37,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:22:37,770 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:22:37,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:22:33" (1/3) ... [2018-09-10 10:22:37,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd0dd06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:22:37, skipping insertion in model container [2018-09-10 10:22:37,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:34" (2/3) ... [2018-09-10 10:22:37,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd0dd06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:22:37, skipping insertion in model container [2018-09-10 10:22:37,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:22:37" (3/3) ... [2018-09-10 10:22:37,775 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label34_true-unreach-call_false-termination.c [2018-09-10 10:22:37,786 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:22:37,799 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:22:37,859 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:22:37,860 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:22:37,860 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:22:37,860 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:22:37,860 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:22:37,861 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:22:37,863 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:22:37,863 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:22:37,863 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:22:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-10 10:22:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-10 10:22:37,907 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:37,909 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] [2018-09-10 10:22:37,911 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:22:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1842964965, now seen corresponding path program 1 times [2018-09-10 10:22:37,921 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:37,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:37,983 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:38,543 WARN L175 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:22:38,605 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:22:38,608 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:22:38,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:22:38,608 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:38,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:38,632 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:38,633 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:22:38,636 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-10 10:22:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:40,434 INFO L93 Difference]: Finished difference Result 621 states and 1060 transitions. [2018-09-10 10:22:40,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:40,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-09-10 10:22:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:40,458 INFO L225 Difference]: With dead ends: 621 [2018-09-10 10:22:40,459 INFO L226 Difference]: Without dead ends: 382 [2018-09-10 10:22:40,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:22:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-10 10:22:40,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-09-10 10:22:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-10 10:22:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 637 transitions. [2018-09-10 10:22:40,554 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 637 transitions. Word has length 105 [2018-09-10 10:22:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:40,555 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 637 transitions. [2018-09-10 10:22:40,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 637 transitions. [2018-09-10 10:22:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-10 10:22:40,563 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:40,564 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-10 10:22:40,564 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:22:40,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1751788666, now seen corresponding path program 1 times [2018-09-10 10:22:40,565 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:40,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:40,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:40,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:40,567 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:40,792 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:22:40,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:22:40,792 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:40,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:40,796 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:40,796 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:22:40,796 INFO L87 Difference]: Start difference. First operand 381 states and 637 transitions. Second operand 3 states. [2018-09-10 10:22:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:41,996 INFO L93 Difference]: Finished difference Result 1049 states and 1823 transitions. [2018-09-10 10:22:41,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:41,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-09-10 10:22:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:42,009 INFO L225 Difference]: With dead ends: 1049 [2018-09-10 10:22:42,009 INFO L226 Difference]: Without dead ends: 674 [2018-09-10 10:22:42,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:22:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-09-10 10:22:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2018-09-10 10:22:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-09-10 10:22:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1036 transitions. [2018-09-10 10:22:42,062 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1036 transitions. Word has length 114 [2018-09-10 10:22:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:42,063 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 1036 transitions. [2018-09-10 10:22:42,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1036 transitions. [2018-09-10 10:22:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-10 10:22:42,073 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:42,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:42,073 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:22:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1298262859, now seen corresponding path program 1 times [2018-09-10 10:22:42,074 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:42,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:42,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:42,076 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:42,251 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:22:42,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:22:42,252 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:42,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:42,253 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:42,253 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:22:42,253 INFO L87 Difference]: Start difference. First operand 674 states and 1036 transitions. Second operand 3 states. [2018-09-10 10:22:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:44,218 INFO L93 Difference]: Finished difference Result 1930 states and 3059 transitions. [2018-09-10 10:22:44,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:44,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-09-10 10:22:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:44,231 INFO L225 Difference]: With dead ends: 1930 [2018-09-10 10:22:44,232 INFO L226 Difference]: Without dead ends: 1262 [2018-09-10 10:22:44,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:22:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-10 10:22:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1257. [2018-09-10 10:22:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2018-09-10 10:22:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1856 transitions. [2018-09-10 10:22:44,297 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1856 transitions. Word has length 140 [2018-09-10 10:22:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:44,298 INFO L480 AbstractCegarLoop]: Abstraction has 1257 states and 1856 transitions. [2018-09-10 10:22:44,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1856 transitions. [2018-09-10 10:22:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-10 10:22:44,314 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:44,315 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:44,315 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:22:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1318523487, now seen corresponding path program 1 times [2018-09-10 10:22:44,317 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:44,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:44,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:44,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:44,318 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:44,563 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:22:44,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:22:44,563 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:44,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:44,564 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:44,564 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:22:44,565 INFO L87 Difference]: Start difference. First operand 1257 states and 1856 transitions. Second operand 3 states. [2018-09-10 10:22:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:46,813 INFO L93 Difference]: Finished difference Result 3668 states and 5599 transitions. [2018-09-10 10:22:46,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:46,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2018-09-10 10:22:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:46,835 INFO L225 Difference]: With dead ends: 3668 [2018-09-10 10:22:46,835 INFO L226 Difference]: Without dead ends: 2417 [2018-09-10 10:22:46,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:22:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2018-09-10 10:22:46,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2417. [2018-09-10 10:22:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2417 states. [2018-09-10 10:22:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3460 transitions. [2018-09-10 10:22:46,941 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3460 transitions. Word has length 157 [2018-09-10 10:22:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:46,942 INFO L480 AbstractCegarLoop]: Abstraction has 2417 states and 3460 transitions. [2018-09-10 10:22:46,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3460 transitions. [2018-09-10 10:22:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-10 10:22:46,955 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:46,956 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:46,956 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:22:46,956 INFO L82 PathProgramCache]: Analyzing trace with hash -574590797, now seen corresponding path program 1 times [2018-09-10 10:22:46,957 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:46,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:46,958 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:47,191 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:22:47,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:22:47,191 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:47,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:22:47,192 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:22:47,192 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:22:47,192 INFO L87 Difference]: Start difference. First operand 2417 states and 3460 transitions. Second operand 6 states. [2018-09-10 10:22:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:48,615 INFO L93 Difference]: Finished difference Result 5147 states and 7483 transitions. [2018-09-10 10:22:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:22:48,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-09-10 10:22:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:48,644 INFO L225 Difference]: With dead ends: 5147 [2018-09-10 10:22:48,644 INFO L226 Difference]: Without dead ends: 2736 [2018-09-10 10:22:48,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:22:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2018-09-10 10:22:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2633. [2018-09-10 10:22:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2018-09-10 10:22:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3402 transitions. [2018-09-10 10:22:48,761 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3402 transitions. Word has length 164 [2018-09-10 10:22:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:48,761 INFO L480 AbstractCegarLoop]: Abstraction has 2633 states and 3402 transitions. [2018-09-10 10:22:48,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:22:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3402 transitions. [2018-09-10 10:22:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-10 10:22:48,772 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:48,772 INFO L376 BasicCegarLoop]: trace histogram [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, 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] [2018-09-10 10:22:48,772 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:22:48,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1770245374, now seen corresponding path program 1 times [2018-09-10 10:22:48,773 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:48,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:48,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:48,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:48,775 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:49,017 WARN L175 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:22:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:22:49,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:49,188 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:22:49,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:49,205 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:49,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:49,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 67 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:22:50,145 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:50,145 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 3 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 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:22:50,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:50,173 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:50,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:22:50,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:22:51,495 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:22:51,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 5] total 11 [2018-09-10 10:22:51,496 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:51,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:22:51,497 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:22:51,499 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:22:51,500 INFO L87 Difference]: Start difference. First operand 2633 states and 3402 transitions. Second operand 5 states. [2018-09-10 10:22:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:53,433 INFO L93 Difference]: Finished difference Result 5239 states and 6787 transitions. [2018-09-10 10:22:53,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:22:53,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2018-09-10 10:22:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:53,439 INFO L225 Difference]: With dead ends: 5239 [2018-09-10 10:22:53,439 INFO L226 Difference]: Without dead ends: 1201 [2018-09-10 10:22:53,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 680 SyntacticMatches, 10 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:22:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2018-09-10 10:22:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2018-09-10 10:22:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2018-09-10 10:22:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1551 transitions. [2018-09-10 10:22:53,480 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1551 transitions. Word has length 173 [2018-09-10 10:22:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:53,481 INFO L480 AbstractCegarLoop]: Abstraction has 1201 states and 1551 transitions. [2018-09-10 10:22:53,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:22:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1551 transitions. [2018-09-10 10:22:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-10 10:22:53,487 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:53,487 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-09-10 10:22:53,487 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:22:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1170013374, now seen corresponding path program 1 times [2018-09-10 10:22:53,488 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:53,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:53,489 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 100 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:22:53,874 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:22:53,874 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:22:53,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:53,883 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:22:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:54,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:22:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-10 10:22:54,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:22:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-10 10:22:54,326 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:22:54,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:22:54,326 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:54,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:54,327 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:54,327 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:22:54,328 INFO L87 Difference]: Start difference. First operand 1201 states and 1551 transitions. Second operand 3 states. [2018-09-10 10:22:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:22:54,694 INFO L93 Difference]: Finished difference Result 2084 states and 2682 transitions. [2018-09-10 10:22:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:22:54,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-09-10 10:22:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:22:54,695 INFO L225 Difference]: With dead ends: 2084 [2018-09-10 10:22:54,695 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:22:54,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 426 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:22:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:22:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:22:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:22:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:22:54,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2018-09-10 10:22:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:22:54,704 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:22:54,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:22:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:22:54,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:22:54,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:22:54,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:54,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:54,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:54,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:22:54,910 WARN L175 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-10 10:22:55,418 WARN L175 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2018-09-10 10:22:55,520 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-10 10:22:55,638 WARN L175 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-10 10:22:55,641 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,641 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,641 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,641 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,642 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,642 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-10 10:22:55,642 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-10 10:22:55,642 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-10 10:22:55,642 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-10 10:22:55,642 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-10 10:22:55,642 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-10 10:22:55,642 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-10 10:22:55,643 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-10 10:22:55,643 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-10 10:22:55,643 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-10 10:22:55,643 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:22:55,643 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:22:55,643 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-10 10:22:55,643 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,643 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,643 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:22:55,644 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:22:55,645 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-10 10:22:55,645 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-10 10:22:55,645 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-10 10:22:55,645 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:22:55,645 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:22:55,645 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-10 10:22:55,645 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,645 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,645 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,646 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,646 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,646 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:22:55,646 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-10 10:22:55,646 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:22:55,646 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 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,646 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-10 10:22:55,646 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-10 10:22:55,646 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-10 10:22:55,647 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-10 10:22:55,647 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-10 10:22:55,647 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 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,647 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-10 10:22:55,647 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-10 10:22:55,647 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-10 10:22:55,647 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,647 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,648 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,648 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,648 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,648 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-10 10:22:55,648 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-10 10:22:55,648 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-10 10:22:55,648 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-10 10:22:55,648 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-10 10:22:55,648 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-10 10:22:55,649 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-10 10:22:55,649 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-10 10:22:55,649 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-10 10:22:55,649 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-10 10:22:55,649 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-10 10:22:55,649 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-10 10:22:55,649 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-10 10:22:55,650 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,650 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,650 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,650 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,650 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,650 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-10 10:22:55,650 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-10 10:22:55,650 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-10 10:22:55,650 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-10 10:22:55,651 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-10 10:22:55,651 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-10 10:22:55,651 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-10 10:22:55,651 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-10 10:22:55,651 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-10 10:22:55,651 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-10 10:22:55,651 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-10 10:22:55,651 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-10 10:22:55,652 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-10 10:22:55,652 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:22:55,652 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-10 10:22:55,652 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:22:55,652 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,652 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,652 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,652 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,652 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-10 10:22:55,653 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-10 10:22:55,654 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,655 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-10 10:22:55,656 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,657 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 466) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-10 10:22:55,657 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,658 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-10 10:22:55,659 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-10 10:22:55,660 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-10 10:22:55,661 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-10 10:22:55,661 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-10 10:22:55,661 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-10 10:22:55,661 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 29 598) 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__a11~0)| 1))) (let ((.cse11 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse5 (not .cse6)) (.cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse13 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1))) (.cse7 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1))) (.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9)) (.cse9 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9))) (.cse10 (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) (.cse8 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5) (or .cse3 .cse6 .cse7 .cse8 (and .cse9 .cse0 .cse10 .cse11)) (or (and .cse0 .cse2 .cse11) .cse3 .cse7 .cse5) (or (and .cse0 .cse2 .cse12) .cse3 .cse13 .cse5) (or .cse12 .cse3 .cse13 .cse4 .cse8) (or .cse12 .cse3 .cse13 .cse7 .cse8) (or .cse3 (and .cse9 .cse0 .cse1 .cse10) .cse6 .cse4 .cse8)))) [2018-09-10 10:22:55,662 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-10 10:22:55,662 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-10 10:22:55,662 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-10 10:22:55,662 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-10 10:22:55,662 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-10 10:22:55,662 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-10 10:22:55,662 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:22:55,662 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-10 10:22:55,663 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:22:55,663 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-10 10:22:55,663 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:22:55,663 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:22:55,663 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-10 10:22:55,663 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-10 10:22:55,663 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:22:55,663 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__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (or (not (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|))) [2018-09-10 10:22:55,664 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:22:55,664 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:22:55,664 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) [2018-09-10 10:22:55,664 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:22:55,664 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:22:55,664 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) [2018-09-10 10:22:55,665 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-10 10:22:55,665 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9))) (.cse3 (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (and .cse0 .cse3 .cse4) (and .cse0 .cse1 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (and .cse0 .cse2 .cse4) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) [2018-09-10 10:22:55,665 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:22:55,665 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:22:55,665 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9))) (.cse3 (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (and .cse0 .cse3 .cse4) (and .cse0 .cse1 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (and .cse0 .cse2 .cse4) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) [2018-09-10 10:22:55,665 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-10 10:22:55,665 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-10 10:22:55,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:22:55 BoogieIcfgContainer [2018-09-10 10:22:55,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:22:55,690 INFO L168 Benchmark]: Toolchain (without parser) took 22401.21 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.2 GB in the end (delta: -750.8 MB). Peak memory consumption was 355.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:55,691 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:22:55,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:55,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:22:55,693 INFO L168 Benchmark]: Boogie Preprocessor took 218.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.7 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:55,694 INFO L168 Benchmark]: RCFGBuilder took 3421.49 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: 122.1 MB). Peak memory consumption was 122.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:55,695 INFO L168 Benchmark]: TraceAbstraction took 17922.19 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 347.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -65.9 MB). Peak memory consumption was 281.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:22:55,700 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 114.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 218.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.7 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3421.49 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: 122.1 MB). Peak memory consumption was 122.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17922.19 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 347.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -65.9 MB). Peak memory consumption was 281.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 466]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && 8 <= __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__a19)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && 8 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 9) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) == 1) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) == 1)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 9) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) < 8 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 17.8s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1302 SDtfs, 2193 SDslu, 412 SDs, 0 SdLazy, 3277 SolverSat, 788 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1158 GetRequests, 1119 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2633occurred 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.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 109 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 73 PreInvPairs, 99 NumberOfFragments, 383 HoareAnnotationTreeSize, 73 FomulaSimplifications, 470 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 315 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1625 NumberOfCodeBlocks, 1625 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2171 ConstructedInterpolants, 0 QuantifiedInterpolants, 866175 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1314 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 857/897 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/Problem02_label34_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-22-55-728.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label34_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-22-55-728.csv Received shutdown request...