java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label52_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 12:47:15,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 12:47:15,764 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 12:47:15,776 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 12:47:15,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 12:47:15,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 12:47:15,779 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 12:47:15,781 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 12:47:15,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 12:47:15,783 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 12:47:15,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 12:47:15,784 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 12:47:15,785 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 12:47:15,786 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 12:47:15,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 12:47:15,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 12:47:15,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 12:47:15,791 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 12:47:15,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 12:47:15,795 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 12:47:15,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 12:47:15,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 12:47:15,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 12:47:15,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 12:47:15,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 12:47:15,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 12:47:15,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 12:47:15,807 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 12:47:15,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 12:47:15,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 12:47:15,812 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 12:47:15,813 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 12:47:15,813 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 12:47:15,813 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 12:47:15,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 12:47:15,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 12:47:15,817 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 12:47:15,848 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 12:47:15,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 12:47:15,850 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 12:47:15,851 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 12:47:15,851 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 12:47:15,851 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 12:47:15,851 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 12:47:15,851 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 12:47:15,852 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 12:47:15,852 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 12:47:15,852 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 12:47:15,853 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 12:47:15,853 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 12:47:15,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 12:47:15,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 12:47:15,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 12:47:15,854 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 12:47:15,854 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 12:47:15,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 12:47:15,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 12:47:15,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 12:47:15,855 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 12:47:15,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 12:47:15,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:47:15,858 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 12:47:15,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 12:47:15,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 12:47:15,858 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 12:47:15,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 12:47:15,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 12:47:15,859 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 12:47:15,859 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 12:47:15,859 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 12:47:15,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 12:47:15,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 12:47:15,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 12:47:15,936 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 12:47:15,936 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 12:47:15,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label52_true-unreach-call_false-termination.c [2018-07-24 12:47:16,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ac7242a/bc47cc9d920c4bb48e44bc1497fd7882/FLAG74dc3d32a [2018-07-24 12:47:16,616 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 12:47:16,622 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label52_true-unreach-call_false-termination.c [2018-07-24 12:47:16,648 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ac7242a/bc47cc9d920c4bb48e44bc1497fd7882/FLAG74dc3d32a [2018-07-24 12:47:16,672 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ac7242a/bc47cc9d920c4bb48e44bc1497fd7882 [2018-07-24 12:47:16,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 12:47:16,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 12:47:16,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 12:47:16,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 12:47:16,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 12:47:16,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:47:16" (1/1) ... [2018-07-24 12:47:16,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f3b58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:16, skipping insertion in model container [2018-07-24 12:47:16,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:47:16" (1/1) ... [2018-07-24 12:47:16,897 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 12:47:17,148 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:47:17,166 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 12:47:17,345 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:47:17,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17 WrapperNode [2018-07-24 12:47:17,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 12:47:17,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 12:47:17,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 12:47:17,388 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 12:47:17,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 12:47:17,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 12:47:17,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 12:47:17,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 12:47:17,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 12:47:17,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 12:47:17,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 12:47:17,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 12:47:17,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:47:17,765 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-07-24 12:47:17,765 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-07-24 12:47:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 12:47:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 12:47:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 12:47:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 12:47:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 12:47:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 12:47:21,049 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 12:47:21,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:47:21 BoogieIcfgContainer [2018-07-24 12:47:21,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 12:47:21,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 12:47:21,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 12:47:21,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 12:47:21,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 12:47:16" (1/3) ... [2018-07-24 12:47:21,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737f4588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:47:21, skipping insertion in model container [2018-07-24 12:47:21,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (2/3) ... [2018-07-24 12:47:21,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737f4588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:47:21, skipping insertion in model container [2018-07-24 12:47:21,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:47:21" (3/3) ... [2018-07-24 12:47:21,059 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label52_true-unreach-call_false-termination.c [2018-07-24 12:47:21,070 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 12:47:21,083 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 12:47:21,147 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 12:47:21,148 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 12:47:21,148 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 12:47:21,148 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 12:47:21,148 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 12:47:21,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 12:47:21,149 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 12:47:21,149 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 12:47:21,149 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 12:47:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-07-24 12:47:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-24 12:47:21,188 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:21,190 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:21,190 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash -48251875, now seen corresponding path program 1 times [2018-07-24 12:47:21,197 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:21,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:21,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:21,737 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:47:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:21,800 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:21,800 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:47:21,801 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:21,807 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:21,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:21,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:47:21,826 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-07-24 12:47:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:23,332 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-07-24 12:47:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:23,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-07-24 12:47:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:23,354 INFO L225 Difference]: With dead ends: 621 [2018-07-24 12:47:23,355 INFO L226 Difference]: Without dead ends: 382 [2018-07-24 12:47:23,362 INFO L573 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-07-24 12:47:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-24 12:47:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-07-24 12:47:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-07-24 12:47:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-07-24 12:47:23,441 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 111 [2018-07-24 12:47:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:23,442 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-07-24 12:47:23,443 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-07-24 12:47:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-24 12:47:23,449 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:23,449 INFO L353 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, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:23,449 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash 244808434, now seen corresponding path program 1 times [2018-07-24 12:47:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:23,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:23,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:23,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:23,896 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:23,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:23,896 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:23,900 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:23,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:23,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:23,901 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-07-24 12:47:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:25,668 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-07-24 12:47:25,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:25,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-07-24 12:47:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:25,674 INFO L225 Difference]: With dead ends: 903 [2018-07-24 12:47:25,674 INFO L226 Difference]: Without dead ends: 381 [2018-07-24 12:47:25,681 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-07-24 12:47:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-07-24 12:47:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-24 12:47:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-07-24 12:47:25,710 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 120 [2018-07-24 12:47:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:25,710 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-07-24 12:47:25,710 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-07-24 12:47:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-24 12:47:25,715 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:25,715 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:25,716 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash -943580994, now seen corresponding path program 1 times [2018-07-24 12:47:25,716 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:25,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:25,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:25,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:25,718 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:26,102 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:26,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:26,103 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:26,103 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:26,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:26,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:26,104 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-07-24 12:47:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:28,007 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-07-24 12:47:28,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:28,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-07-24 12:47:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:28,012 INFO L225 Difference]: With dead ends: 901 [2018-07-24 12:47:28,013 INFO L226 Difference]: Without dead ends: 380 [2018-07-24 12:47:28,015 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-07-24 12:47:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-07-24 12:47:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-07-24 12:47:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-07-24 12:47:28,036 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 126 [2018-07-24 12:47:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:28,037 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-07-24 12:47:28,037 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-07-24 12:47:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-24 12:47:28,040 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:28,040 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:28,040 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:28,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1859328171, now seen corresponding path program 1 times [2018-07-24 12:47:28,041 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:28,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:28,042 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:28,273 WARN L169 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:47:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:28,430 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:28,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:47:28,430 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:28,431 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:47:28,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:47:28,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:47:28,432 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-07-24 12:47:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:31,841 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-07-24 12:47:31,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:47:31,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-07-24 12:47:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:31,851 INFO L225 Difference]: With dead ends: 1193 [2018-07-24 12:47:31,851 INFO L226 Difference]: Without dead ends: 819 [2018-07-24 12:47:31,853 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:47:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-07-24 12:47:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-07-24 12:47:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-07-24 12:47:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-07-24 12:47:31,919 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 134 [2018-07-24 12:47:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:31,919 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-07-24 12:47:31,919 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:47:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-07-24 12:47:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-24 12:47:31,923 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:31,924 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:31,925 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash 337404569, now seen corresponding path program 1 times [2018-07-24 12:47:31,925 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:31,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:31,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:31,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:31,927 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:32,279 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:32,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:32,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:32,280 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:32,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:32,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:32,280 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-07-24 12:47:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:33,575 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-07-24 12:47:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:33,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2018-07-24 12:47:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:33,583 INFO L225 Difference]: With dead ends: 1753 [2018-07-24 12:47:33,583 INFO L226 Difference]: Without dead ends: 804 [2018-07-24 12:47:33,586 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-07-24 12:47:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-07-24 12:47:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-07-24 12:47:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-07-24 12:47:33,611 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 136 [2018-07-24 12:47:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:33,612 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-07-24 12:47:33,612 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-07-24 12:47:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-24 12:47:33,615 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:33,615 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:33,615 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1521181219, now seen corresponding path program 1 times [2018-07-24 12:47:33,616 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:33,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:33,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:33,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:33,617 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:33,892 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:33,892 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:33,892 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:33,893 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:33,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:33,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:33,893 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-07-24 12:47:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:34,997 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-07-24 12:47:34,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:35,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2018-07-24 12:47:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:35,005 INFO L225 Difference]: With dead ends: 1747 [2018-07-24 12:47:35,005 INFO L226 Difference]: Without dead ends: 801 [2018-07-24 12:47:35,008 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-07-24 12:47:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-07-24 12:47:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-07-24 12:47:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-07-24 12:47:35,030 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 138 [2018-07-24 12:47:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:35,031 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-07-24 12:47:35,031 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-07-24 12:47:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-24 12:47:35,034 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:35,034 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:35,035 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1105155173, now seen corresponding path program 1 times [2018-07-24 12:47:35,035 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:35,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:35,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:35,364 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:35,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:47:35,365 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:35,365 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:47:35,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:47:35,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:47:35,366 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-07-24 12:47:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:36,871 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-07-24 12:47:36,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:47:36,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-07-24 12:47:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:36,882 INFO L225 Difference]: With dead ends: 2381 [2018-07-24 12:47:36,882 INFO L226 Difference]: Without dead ends: 1586 [2018-07-24 12:47:36,887 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:47:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-07-24 12:47:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-07-24 12:47:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-07-24 12:47:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-07-24 12:47:36,938 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 142 [2018-07-24 12:47:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:36,939 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-07-24 12:47:36,939 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:47:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-07-24 12:47:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-24 12:47:36,943 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:36,943 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:36,944 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:36,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1939278738, now seen corresponding path program 1 times [2018-07-24 12:47:36,944 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:36,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:36,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:36,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:36,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:37,451 WARN L169 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-07-24 12:47:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:37,554 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:37,555 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:47:37,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:37,564 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:37,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:47:37,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:47:38,267 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:47:38,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2018-07-24 12:47:38,268 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:38,268 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:38,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:38,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-07-24 12:47:38,269 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-07-24 12:47:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:40,171 INFO L93 Difference]: Finished difference Result 3798 states and 5500 transitions. [2018-07-24 12:47:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:40,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-07-24 12:47:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:40,188 INFO L225 Difference]: With dead ends: 3798 [2018-07-24 12:47:40,188 INFO L226 Difference]: Without dead ends: 2246 [2018-07-24 12:47:40,195 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-07-24 12:47:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-07-24 12:47:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2018-07-24 12:47:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-07-24 12:47:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3096 transitions. [2018-07-24 12:47:40,268 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3096 transitions. Word has length 148 [2018-07-24 12:47:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:40,268 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 3096 transitions. [2018-07-24 12:47:40,269 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3096 transitions. [2018-07-24 12:47:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-24 12:47:40,279 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:40,280 INFO L353 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:40,280 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:40,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1455172501, now seen corresponding path program 1 times [2018-07-24 12:47:40,280 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:40,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:40,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:40,282 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:40,797 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:40,797 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:47:40,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:40,812 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:40,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:41,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:41,611 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:47:41,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-07-24 12:47:41,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:41,612 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:41,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:41,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-24 12:47:41,613 INFO L87 Difference]: Start difference. First operand 2246 states and 3096 transitions. Second operand 3 states. [2018-07-24 12:47:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:42,427 INFO L93 Difference]: Finished difference Result 4487 states and 6220 transitions. [2018-07-24 12:47:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:42,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2018-07-24 12:47:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:42,443 INFO L225 Difference]: With dead ends: 4487 [2018-07-24 12:47:42,443 INFO L226 Difference]: Without dead ends: 2247 [2018-07-24 12:47:42,453 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-24 12:47:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2018-07-24 12:47:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2242. [2018-07-24 12:47:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2018-07-24 12:47:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2984 transitions. [2018-07-24 12:47:42,515 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2984 transitions. Word has length 177 [2018-07-24 12:47:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:42,516 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 2984 transitions. [2018-07-24 12:47:42,516 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2984 transitions. [2018-07-24 12:47:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-24 12:47:42,524 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:42,524 INFO L353 BasicCegarLoop]: trace histogram [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, 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] [2018-07-24 12:47:42,525 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash -77110827, now seen corresponding path program 1 times [2018-07-24 12:47:42,525 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:42,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:42,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:43,006 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:43,006 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:47:43,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:43,086 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:43,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:47:43,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:47:43,469 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:47:43,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-07-24 12:47:43,470 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:43,470 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:43,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:43,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-24 12:47:43,472 INFO L87 Difference]: Start difference. First operand 2242 states and 2984 transitions. Second operand 3 states. [2018-07-24 12:47:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:44,382 INFO L93 Difference]: Finished difference Result 5143 states and 6999 transitions. [2018-07-24 12:47:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:44,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-07-24 12:47:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:44,395 INFO L225 Difference]: With dead ends: 5143 [2018-07-24 12:47:44,395 INFO L226 Difference]: Without dead ends: 2907 [2018-07-24 12:47:44,404 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-24 12:47:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2018-07-24 12:47:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2899. [2018-07-24 12:47:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2018-07-24 12:47:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 3749 transitions. [2018-07-24 12:47:44,470 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 3749 transitions. Word has length 180 [2018-07-24 12:47:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:44,471 INFO L471 AbstractCegarLoop]: Abstraction has 2899 states and 3749 transitions. [2018-07-24 12:47:44,471 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3749 transitions. [2018-07-24 12:47:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-07-24 12:47:44,484 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:44,484 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 12:47:44,484 INFO L414 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:44,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1113148345, now seen corresponding path program 1 times [2018-07-24 12:47:44,485 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:44,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:44,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:44,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:44,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-07-24 12:47:44,715 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:44,715 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:47:44,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:44,723 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:44,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:45,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:45,445 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:45,445 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 12:47:45,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:45,461 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:45,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:45,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:46,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:47:46,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 16 [2018-07-24 12:47:46,149 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:47:46,150 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 12:47:46,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 12:47:46,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-07-24 12:47:46,151 INFO L87 Difference]: Start difference. First operand 2899 states and 3749 transitions. Second operand 9 states. [2018-07-24 12:47:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:51,056 INFO L93 Difference]: Finished difference Result 9018 states and 12871 transitions. [2018-07-24 12:47:51,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-24 12:47:51,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 225 [2018-07-24 12:47:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:51,057 INFO L225 Difference]: With dead ends: 9018 [2018-07-24 12:47:51,057 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 12:47:51,111 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 908 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2018-07-24 12:47:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 12:47:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 12:47:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 12:47:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 12:47:51,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2018-07-24 12:47:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:51,112 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 12:47:51,113 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 12:47:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 12:47:51,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 12:47:51,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 12:47:51,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:51,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:51,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:51,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:51,306 WARN L169 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 79 [2018-07-24 12:47:51,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:51,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:51,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:51,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:51,448 WARN L169 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 79 [2018-07-24 12:47:52,579 WARN L169 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2018-07-24 12:47:53,175 WARN L169 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2018-07-24 12:47:55,036 WARN L169 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2018-07-24 12:47:55,051 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-07-24 12:47:55,051 INFO L421 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-07-24 12:47:55,051 INFO L421 ceAbstractionStarter]: For program point L203''(lines 203 210) no Hoare annotation was computed. [2018-07-24 12:47:55,051 INFO L421 ceAbstractionStarter]: For program point L417'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,051 INFO L421 ceAbstractionStarter]: For program point L429'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,051 INFO L421 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-07-24 12:47:55,052 INFO L421 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-07-24 12:47:55,052 INFO L421 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-07-24 12:47:55,052 INFO L421 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-07-24 12:47:55,052 INFO L421 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-07-24 12:47:55,052 INFO L421 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-07-24 12:47:55,052 INFO L421 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-07-24 12:47:55,052 INFO L421 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-07-24 12:47:55,052 INFO L421 ceAbstractionStarter]: For program point L501'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,052 INFO L421 ceAbstractionStarter]: For program point L513'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L525'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L537'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L549'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L507'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L519'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L504'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L516'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L528'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L238''(lines 238 246) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-07-24 12:47:55,053 INFO L421 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-07-24 12:47:55,054 INFO L417 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 ((.cse13 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse14 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse15 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|)) (.cse16 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) (.cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (.cse6 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1))) (let ((.cse17 (= |old(~__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)) (.cse7 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (.cse0 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7))) (.cse9 (not .cse6)) (.cse10 (not .cse2)) (.cse5 (= 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)) (.cse8 (not .cse16)) (.cse12 (and .cse13 .cse14 .cse15)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse11 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9))) (and (or .cse0 .cse1 .cse2 (and .cse3 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (not .cse4) .cse5) .cse6 .cse7 .cse8) (or .cse1 .cse7 .cse9 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10)) (and .cse3 .cse5 .cse4) .cse10 .cse8) (or .cse1 .cse6 .cse11 .cse12) (or .cse1 (and .cse13 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) .cse14 .cse15) .cse16) (or .cse1 .cse9 .cse17 .cse12) (or .cse1 (not .cse17) (and .cse3 .cse5 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) .cse7 .cse9 .cse10 .cse8) (or .cse0 .cse1 .cse9 .cse10 (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse5 .cse4) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7)) .cse8) (or .cse12 .cse1 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) .cse11)))) [2018-07-24 12:47:55,054 INFO L421 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-07-24 12:47:55,054 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-07-24 12:47:55,054 INFO L421 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-07-24 12:47:55,055 INFO L421 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-07-24 12:47:55,055 INFO L421 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-07-24 12:47:55,055 INFO L421 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-07-24 12:47:55,055 INFO L421 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-07-24 12:47:55,055 INFO L421 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-07-24 12:47:55,055 INFO L421 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-07-24 12:47:55,055 INFO L421 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-07-24 12:47:55,055 INFO L421 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-07-24 12:47:55,056 INFO L421 ceAbstractionStarter]: For program point L480'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,056 INFO L421 ceAbstractionStarter]: For program point L492'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,056 INFO L421 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-07-24 12:47:55,056 INFO L421 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-07-24 12:47:55,056 INFO L421 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-07-24 12:47:55,056 INFO L421 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-07-24 12:47:55,056 INFO L421 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-07-24 12:47:55,057 INFO L421 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-07-24 12:47:55,057 INFO L421 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-07-24 12:47:55,057 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-07-24 12:47:55,057 INFO L421 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-07-24 12:47:55,057 INFO L421 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-07-24 12:47:55,057 INFO L421 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-07-24 12:47:55,057 INFO L421 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-07-24 12:47:55,057 INFO L421 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-07-24 12:47:55,057 INFO L421 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-07-24 12:47:55,058 INFO L421 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-07-24 12:47:55,058 INFO L421 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-07-24 12:47:55,058 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-07-24 12:47:55,058 INFO L421 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-07-24 12:47:55,058 INFO L421 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-07-24 12:47:55,058 INFO L421 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-07-24 12:47:55,058 INFO L421 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-07-24 12:47:55,058 INFO L421 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L332''(lines 332 335) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-07-24 12:47:55,059 INFO L421 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-07-24 12:47:55,060 INFO L421 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION(line 484) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L570'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L582'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L594'(lines 594 596) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-07-24 12:47:55,061 INFO L421 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L298''(lines 298 307) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L591'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-07-24 12:47:55,062 INFO L421 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L471'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L483'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-07-24 12:47:55,063 INFO L421 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L495'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L561'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,064 INFO L421 ceAbstractionStarter]: For program point L573'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L585'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L477'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L489'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L441'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L453'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,065 INFO L421 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-07-24 12:47:55,066 INFO L421 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-07-24 12:47:55,066 INFO L421 ceAbstractionStarter]: For program point L465'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,066 INFO L421 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-07-24 12:47:55,066 INFO L421 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-07-24 12:47:55,066 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-07-24 12:47:55,066 INFO L421 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-07-24 12:47:55,066 INFO L421 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-07-24 12:47:55,066 INFO L421 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-07-24 12:47:55,066 INFO L421 ceAbstractionStarter]: For program point L75''(lines 75 80) no Hoare annotation was computed. [2018-07-24 12:47:55,067 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-07-24 12:47:55,067 INFO L421 ceAbstractionStarter]: For program point L450'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,067 INFO L421 ceAbstractionStarter]: For program point L462'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,067 INFO L421 ceAbstractionStarter]: For program point L474'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,067 INFO L421 ceAbstractionStarter]: For program point L486'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,067 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-07-24 12:47:55,067 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-07-24 12:47:55,067 INFO L421 ceAbstractionStarter]: For program point L498'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,067 INFO L421 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L420'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-07-24 12:47:55,068 INFO L421 ceAbstractionStarter]: For program point L432'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L414''(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L381''(lines 381 387) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L83''(lines 83 89) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L543'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L555'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L567'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L579'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,069 INFO L421 ceAbstractionStarter]: For program point L576'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L588'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L540'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L552'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L564'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L444'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L456'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L468'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L338''(lines 338 347) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L315''(lines 315 326) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L262''(lines 262 274) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L510'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,070 INFO L421 ceAbstractionStarter]: For program point L522'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L534'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L546'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L558'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L426'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L438'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L531'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L423'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L435'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,071 INFO L421 ceAbstractionStarter]: For program point L447'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,072 INFO L421 ceAbstractionStarter]: For program point L459'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:55,072 INFO L421 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-07-24 12:47:55,072 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-07-24 12:47:55,072 INFO L421 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-07-24 12:47:55,072 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-07-24 12:47:55,072 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|)) [2018-07-24 12:47:55,072 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-07-24 12:47:55,072 INFO L417 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__a25~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) [2018-07-24 12:47:55,072 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-07-24 12:47:55,072 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 12:47:55,072 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 12:47:55,072 INFO L421 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-07-24 12:47:55,073 INFO L421 ceAbstractionStarter]: For program point L606'''(lines 600 617) no Hoare annotation was computed. [2018-07-24 12:47:55,073 INFO L417 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse7 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse4 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse6 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse5 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse8 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0))) (or (and .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7) .cse1) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse2 .cse3 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (and .cse4 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse5 .cse1 .cse6) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) .cse1) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (and .cse7 .cse5 .cse1 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse6) (and .cse0 .cse3 .cse8) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse7 .cse5 .cse1 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse6) (and .cse7 .cse4 .cse2 (not .cse6) .cse5) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse0 .cse2 .cse8))) [2018-07-24 12:47:55,073 INFO L417 ceAbstractionStarter]: At program point L606''(lines 606 616) the Hoare annotation is: (let ((.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse7 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse4 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse6 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse5 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse8 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0))) (or (and .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7) .cse1) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse2 .cse3 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (and .cse4 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse5 .cse1 .cse6) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) .cse1) (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (and .cse7 .cse5 .cse1 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse6) (and .cse0 .cse3 .cse8) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse7 .cse5 .cse1 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse6) (and .cse7 .cse4 .cse2 (not .cse6) .cse5) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse0 .cse2 .cse8))) [2018-07-24 12:47:55,073 INFO L421 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-07-24 12:47:55,073 INFO L417 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) [2018-07-24 12:47:55,073 INFO L421 ceAbstractionStarter]: For program point L614'(line 614) no Hoare annotation was computed. [2018-07-24 12:47:55,073 INFO L421 ceAbstractionStarter]: For program point L606(lines 606 616) no Hoare annotation was computed. [2018-07-24 12:47:55,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 12:47:55 BoogieIcfgContainer [2018-07-24 12:47:55,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 12:47:55,105 INFO L168 Benchmark]: Toolchain (without parser) took 38419.23 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -395.1 MB). Peak memory consumption was 789.3 MB. Max. memory is 7.1 GB. [2018-07-24 12:47:55,106 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 12:47:55,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.85 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-07-24 12:47:55,107 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 12:47:55,108 INFO L168 Benchmark]: Boogie Preprocessor took 205.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -847.4 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. [2018-07-24 12:47:55,109 INFO L168 Benchmark]: RCFGBuilder took 3356.92 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: 134.6 MB). Peak memory consumption was 134.6 MB. Max. memory is 7.1 GB. [2018-07-24 12:47:55,110 INFO L168 Benchmark]: TraceAbstraction took 34052.92 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 422.1 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 286.1 MB). Peak memory consumption was 708.1 MB. Max. memory is 7.1 GB. [2018-07-24 12:47:55,114 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.26 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 698.85 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 99.31 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 205.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -847.4 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3356.92 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: 134.6 MB). Peak memory consumption was 134.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34052.92 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 422.1 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 286.1 MB). Peak memory consumption was 708.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 484]: 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 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 7) && 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__a21 == 1)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 7) && 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || ((((7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 && 7 == __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__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 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 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && 9 <= \old(__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__a25)) || (__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) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1))) || ((((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__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 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 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 7) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || 7 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || ((((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__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) == 1) || \old(__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__a17 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 33.9s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 21.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1849 SDtfs, 5673 SDslu, 1294 SDs, 0 SdLazy, 10155 SolverSat, 1876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2034 GetRequests, 1932 SyntacticMatches, 17 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2899occurred in iteration=10, 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, 11 MinimizatonAttempts, 53 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 190 PreInvPairs, 424 NumberOfFragments, 587 HoareAnnotationTreeSize, 190 FomulaSimplifications, 8476 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3088 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2592 NumberOfCodeBlocks, 2592 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3526 ConstructedInterpolants, 0 QuantifiedInterpolants, 2098338 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2312 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 1694/1755 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_label52_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_12-47-55-132.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label52_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_12-47-55-132.csv Received shutdown request...