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_label00_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 12:45:36,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 12:45:36,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 12:45:36,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 12:45:36,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 12:45:36,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 12:45:36,651 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 12:45:36,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 12:45:36,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 12:45:36,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 12:45:36,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 12:45:36,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 12:45:36,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 12:45:36,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 12:45:36,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 12:45:36,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 12:45:36,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 12:45:36,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 12:45:36,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 12:45:36,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 12:45:36,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 12:45:36,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 12:45:36,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 12:45:36,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 12:45:36,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 12:45:36,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 12:45:36,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 12:45:36,694 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 12:45:36,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 12:45:36,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 12:45:36,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 12:45:36,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 12:45:36,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 12:45:36,697 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 12:45:36,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 12:45:36,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 12:45:36,701 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:45:36,716 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 12:45:36,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 12:45:36,717 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 12:45:36,717 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 12:45:36,718 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 12:45:36,718 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 12:45:36,718 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 12:45:36,718 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 12:45:36,718 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 12:45:36,719 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 12:45:36,719 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 12:45:36,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 12:45:36,720 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 12:45:36,720 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 12:45:36,720 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 12:45:36,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 12:45:36,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 12:45:36,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 12:45:36,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 12:45:36,721 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 12:45:36,721 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 12:45:36,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 12:45:36,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 12:45:36,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:45:36,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 12:45:36,722 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 12:45:36,723 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 12:45:36,723 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 12:45:36,723 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 12:45:36,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 12:45:36,723 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 12:45:36,724 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 12:45:36,724 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 12:45:36,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 12:45:36,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 12:45:36,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 12:45:36,802 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 12:45:36,803 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 12:45:36,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-07-24 12:45:37,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e535dc2f8/6f82be44ca8e4245a1996d37fe15ba1b/FLAGf7b727f65 [2018-07-24 12:45:37,477 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 12:45:37,478 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-07-24 12:45:37,500 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e535dc2f8/6f82be44ca8e4245a1996d37fe15ba1b/FLAGf7b727f65 [2018-07-24 12:45:37,515 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e535dc2f8/6f82be44ca8e4245a1996d37fe15ba1b [2018-07-24 12:45:37,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 12:45:37,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 12:45:37,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 12:45:37,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 12:45:37,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 12:45:37,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:45:37" (1/1) ... [2018-07-24 12:45:37,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c2495d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:37, skipping insertion in model container [2018-07-24 12:45:37,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:45:37" (1/1) ... [2018-07-24 12:45:37,767 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 12:45:38,040 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:45:38,056 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 12:45:38,181 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:45:38,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38 WrapperNode [2018-07-24 12:45:38,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 12:45:38,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 12:45:38,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 12:45:38,230 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 12:45:38,239 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:45:38" (1/1) ... [2018-07-24 12:45:38,270 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:45:38" (1/1) ... [2018-07-24 12:45:38,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 12:45:38,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 12:45:38,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 12:45:38,338 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 12:45:38,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38" (1/1) ... [2018-07-24 12:45:38,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38" (1/1) ... [2018-07-24 12:45:38,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38" (1/1) ... [2018-07-24 12:45:38,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38" (1/1) ... [2018-07-24 12:45:38,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38" (1/1) ... [2018-07-24 12:45:38,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38" (1/1) ... [2018-07-24 12:45:38,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38" (1/1) ... [2018-07-24 12:45:38,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 12:45:38,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 12:45:38,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 12:45:38,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 12:45:38,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38" (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:45:38,635 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:45:38,635 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:45:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 12:45:38,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 12:45:38,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 12:45:38,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 12:45:38,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 12:45:38,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 12:45:41,601 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 12:45:41,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:45:41 BoogieIcfgContainer [2018-07-24 12:45:41,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 12:45:41,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 12:45:41,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 12:45:41,616 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 12:45:41,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 12:45:37" (1/3) ... [2018-07-24 12:45:41,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4215c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:45:41, skipping insertion in model container [2018-07-24 12:45:41,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:45:38" (2/3) ... [2018-07-24 12:45:41,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4215c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:45:41, skipping insertion in model container [2018-07-24 12:45:41,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:45:41" (3/3) ... [2018-07-24 12:45:41,623 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label00_true-unreach-call_false-termination.c [2018-07-24 12:45:41,634 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 12:45:41,643 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 12:45:41,701 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 12:45:41,702 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 12:45:41,702 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 12:45:41,703 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 12:45:41,703 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 12:45:41,703 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 12:45:41,703 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 12:45:41,704 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 12:45:41,704 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 12:45:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-07-24 12:45:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-24 12:45:41,747 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:45:41,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:45:41,750 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:45:41,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2103258688, now seen corresponding path program 1 times [2018-07-24 12:45:41,760 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:45:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:41,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:45:41,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:41,823 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:45:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:45:42,451 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:45:42,454 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:45:42,454 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:45:42,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:45:42,461 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:45:42,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:45:42,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:45:42,482 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-07-24 12:45:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:45:44,110 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-07-24 12:45:44,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:45:44,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-07-24 12:45:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:45:44,134 INFO L225 Difference]: With dead ends: 621 [2018-07-24 12:45:44,135 INFO L226 Difference]: Without dead ends: 382 [2018-07-24 12:45:44,141 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:45:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-24 12:45:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-07-24 12:45:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-07-24 12:45:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-07-24 12:45:44,227 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 122 [2018-07-24 12:45:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:45:44,228 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-07-24 12:45:44,229 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:45:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-07-24 12:45:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-24 12:45:44,243 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:45:44,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:45:44,244 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:45:44,244 INFO L82 PathProgramCache]: Analyzing trace with hash -262738997, now seen corresponding path program 1 times [2018-07-24 12:45:44,245 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:45:44,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:44,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:45:44,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:44,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:45:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:45:44,814 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:45:44,815 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:45:44,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:45:44,815 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:45:44,817 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:45:44,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:45:44,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:45:44,818 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-07-24 12:45:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:45:46,459 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-07-24 12:45:46,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:45:46,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2018-07-24 12:45:46,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:45:46,466 INFO L225 Difference]: With dead ends: 903 [2018-07-24 12:45:46,467 INFO L226 Difference]: Without dead ends: 381 [2018-07-24 12:45:46,470 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:45:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-07-24 12:45:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-07-24 12:45:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-24 12:45:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-07-24 12:45:46,497 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 131 [2018-07-24 12:45:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:45:46,497 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-07-24 12:45:46,498 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:45:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-07-24 12:45:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-24 12:45:46,501 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:45:46,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:45:46,502 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:45:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash -857213313, now seen corresponding path program 1 times [2018-07-24 12:45:46,502 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:45:46,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:46,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:45:46,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:46,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:45:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:45:46,921 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:45:46,922 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:45:46,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:45:46,922 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:45:46,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:45:46,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:45:46,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:45:46,924 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-07-24 12:45:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:45:48,664 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-07-24 12:45:48,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:45:48,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-07-24 12:45:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:45:48,668 INFO L225 Difference]: With dead ends: 901 [2018-07-24 12:45:48,668 INFO L226 Difference]: Without dead ends: 380 [2018-07-24 12:45:48,672 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:45:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-07-24 12:45:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-07-24 12:45:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-07-24 12:45:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-07-24 12:45:48,692 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 137 [2018-07-24 12:45:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:45:48,693 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-07-24 12:45:48,693 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:45:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-07-24 12:45:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-24 12:45:48,696 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:45:48,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:45:48,696 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:45:48,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1511584648, now seen corresponding path program 1 times [2018-07-24 12:45:48,697 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:45:48,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:48,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:45:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:48,698 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:45:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:45:48,942 WARN L169 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:45:49,041 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:45:49,041 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:45:49,042 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:45:49,042 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:45:49,042 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:45:49,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:45:49,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:45:49,043 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-07-24 12:45:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:45:51,646 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-07-24 12:45:51,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:45:51,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-07-24 12:45:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:45:51,653 INFO L225 Difference]: With dead ends: 1193 [2018-07-24 12:45:51,653 INFO L226 Difference]: Without dead ends: 819 [2018-07-24 12:45:51,655 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:45:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-07-24 12:45:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-07-24 12:45:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-07-24 12:45:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-07-24 12:45:51,696 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 145 [2018-07-24 12:45:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:45:51,696 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-07-24 12:45:51,696 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:45:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-07-24 12:45:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-24 12:45:51,700 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:45:51,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:45:51,701 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:45:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1634633156, now seen corresponding path program 1 times [2018-07-24 12:45:51,701 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:45:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:51,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:45:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:51,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:45:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:45:52,019 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:45:52,019 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:45:52,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:45:52,020 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:45:52,020 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:45:52,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:45:52,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:45:52,021 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-07-24 12:45:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:45:53,264 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-07-24 12:45:53,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:45:53,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-07-24 12:45:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:45:53,272 INFO L225 Difference]: With dead ends: 1753 [2018-07-24 12:45:53,272 INFO L226 Difference]: Without dead ends: 804 [2018-07-24 12:45:53,276 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:45:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-07-24 12:45:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-07-24 12:45:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-07-24 12:45:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-07-24 12:45:53,302 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 147 [2018-07-24 12:45:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:45:53,302 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-07-24 12:45:53,302 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:45:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-07-24 12:45:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-24 12:45:53,306 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:45:53,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:45:53,306 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:45:53,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1501779968, now seen corresponding path program 1 times [2018-07-24 12:45:53,307 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:45:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:53,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:45:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:53,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:45:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:45:53,636 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:45:53,636 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:45:53,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:45:53,637 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:45:53,637 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:45:53,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:45:53,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:45:53,638 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-07-24 12:45:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:45:55,026 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-07-24 12:45:55,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:45:55,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-07-24 12:45:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:45:55,031 INFO L225 Difference]: With dead ends: 1747 [2018-07-24 12:45:55,031 INFO L226 Difference]: Without dead ends: 801 [2018-07-24 12:45:55,034 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:45:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-07-24 12:45:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-07-24 12:45:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-07-24 12:45:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-07-24 12:45:55,058 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 149 [2018-07-24 12:45:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:45:55,058 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-07-24 12:45:55,058 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:45:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-07-24 12:45:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-24 12:45:55,062 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:45:55,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:45:55,062 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:45:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash -995443592, now seen corresponding path program 1 times [2018-07-24 12:45:55,063 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:45:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:55,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:45:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:55,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:45:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:45:55,191 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:45:55,191 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:45:55,192 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:45:55,192 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:45:55,192 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:45:55,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:45:55,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:45:55,193 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-07-24 12:45:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:45:56,408 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-07-24 12:45:56,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:45:56,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-07-24 12:45:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:45:56,425 INFO L225 Difference]: With dead ends: 2381 [2018-07-24 12:45:56,426 INFO L226 Difference]: Without dead ends: 1586 [2018-07-24 12:45:56,430 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:45:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-07-24 12:45:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-07-24 12:45:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-07-24 12:45:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-07-24 12:45:56,489 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 153 [2018-07-24 12:45:56,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:45:56,489 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-07-24 12:45:56,489 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:45:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-07-24 12:45:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-24 12:45:56,494 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:45:56,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:45:56,495 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:45:56,495 INFO L82 PathProgramCache]: Analyzing trace with hash 119270607, now seen corresponding path program 1 times [2018-07-24 12:45:56,495 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:45:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:56,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:45:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:45:56,496 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:45:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:45:57,082 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:45:57,082 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:45:57,082 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:45:57,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:45:57,098 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:45:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:45:57,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:45:57,273 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:45:57,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:45:57,778 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:45:57,818 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:45:57,818 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-07-24 12:45:57,818 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:45:57,819 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:45:57,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:45:57,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:45:57,820 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-07-24 12:46:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:46:01,280 INFO L93 Difference]: Finished difference Result 4565 states and 6657 transitions. [2018-07-24 12:46:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:46:01,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-07-24 12:46:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:46:01,298 INFO L225 Difference]: With dead ends: 4565 [2018-07-24 12:46:01,299 INFO L226 Difference]: Without dead ends: 3013 [2018-07-24 12:46:01,307 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:46:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2018-07-24 12:46:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3008. [2018-07-24 12:46:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-07-24 12:46:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3992 transitions. [2018-07-24 12:46:01,402 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3992 transitions. Word has length 159 [2018-07-24 12:46:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:46:01,403 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 3992 transitions. [2018-07-24 12:46:01,403 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:46:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3992 transitions. [2018-07-24 12:46:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-24 12:46:01,412 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:46:01,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:46:01,412 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:46:01,412 INFO L82 PathProgramCache]: Analyzing trace with hash -243235000, now seen corresponding path program 1 times [2018-07-24 12:46:01,413 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:46:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:46:01,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:46:01,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:46:01,414 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:46:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:46:01,841 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:46:01,841 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:46:01,841 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:46:01,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:46:01,850 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:46:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:46:01,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:46:02,107 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:46:02,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:46:02,335 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:46:02,357 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:46:02,357 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-07-24 12:46:02,358 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:46:02,358 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:46:02,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:46:02,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:46:02,359 INFO L87 Difference]: Start difference. First operand 3008 states and 3992 transitions. Second operand 3 states. [2018-07-24 12:46:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:46:03,579 INFO L93 Difference]: Finished difference Result 7026 states and 9500 transitions. [2018-07-24 12:46:03,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:46:03,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-07-24 12:46:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:46:03,599 INFO L225 Difference]: With dead ends: 7026 [2018-07-24 12:46:03,600 INFO L226 Difference]: Without dead ends: 4024 [2018-07-24 12:46:03,613 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:46:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2018-07-24 12:46:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 4004. [2018-07-24 12:46:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4004 states. [2018-07-24 12:46:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 5097 transitions. [2018-07-24 12:46:03,704 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 5097 transitions. Word has length 188 [2018-07-24 12:46:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:46:03,705 INFO L471 AbstractCegarLoop]: Abstraction has 4004 states and 5097 transitions. [2018-07-24 12:46:03,705 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:46:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 5097 transitions. [2018-07-24 12:46:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-07-24 12:46:03,715 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:46:03,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:46:03,715 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:46:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1455363832, now seen corresponding path program 1 times [2018-07-24 12:46:03,715 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:46:03,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:46:03,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:46:03,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:46:03,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:46:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:46:04,169 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:46:04,169 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:46:04,169 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:46:04,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:46:04,187 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:46:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:46:04,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:46:04,460 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:46:04,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:46:04,696 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:46:04,718 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:46:04,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-07-24 12:46:04,720 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:46:04,721 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:46:04,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:46:04,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-24 12:46:04,722 INFO L87 Difference]: Start difference. First operand 4004 states and 5097 transitions. Second operand 3 states. [2018-07-24 12:46:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:46:05,814 INFO L93 Difference]: Finished difference Result 10553 states and 13691 transitions. [2018-07-24 12:46:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:46:05,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-07-24 12:46:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:46:05,846 INFO L225 Difference]: With dead ends: 10553 [2018-07-24 12:46:05,846 INFO L226 Difference]: Without dead ends: 6555 [2018-07-24 12:46:05,862 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 380 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:46:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6555 states. [2018-07-24 12:46:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6555 to 6549. [2018-07-24 12:46:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6549 states. [2018-07-24 12:46:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6549 states to 6549 states and 8191 transitions. [2018-07-24 12:46:06,021 INFO L78 Accepts]: Start accepts. Automaton has 6549 states and 8191 transitions. Word has length 191 [2018-07-24 12:46:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:46:06,022 INFO L471 AbstractCegarLoop]: Abstraction has 6549 states and 8191 transitions. [2018-07-24 12:46:06,022 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:46:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6549 states and 8191 transitions. [2018-07-24 12:46:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-24 12:46:06,042 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:46:06,043 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:06,043 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:46:06,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1569128080, now seen corresponding path program 1 times [2018-07-24 12:46:06,043 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:46:06,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:46:06,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:46:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:46:06,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:46:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:46:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 156 proven. 52 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 12:46:06,563 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:46:06,564 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:46:06,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:46:06,580 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:46:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:46:06,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:46:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:46:07,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:46:07,244 WARN L169 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 12:46:07,346 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 12:46:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:46:08,007 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:46:08,007 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:46:08,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:46:08,038 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:46:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:46:08,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:46:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-07-24 12:46:08,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:46:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-07-24 12:46:08,909 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-07-24 12:46:08,909 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 5] total 16 [2018-07-24 12:46:08,909 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:46:08,910 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:46:08,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:46:08,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-07-24 12:46:08,911 INFO L87 Difference]: Start difference. First operand 6549 states and 8191 transitions. Second operand 5 states. [2018-07-24 12:46:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:46:10,217 INFO L93 Difference]: Finished difference Result 12624 states and 15794 transitions. [2018-07-24 12:46:10,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:46:10,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 272 [2018-07-24 12:46:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:46:10,219 INFO L225 Difference]: With dead ends: 12624 [2018-07-24 12:46:10,219 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 12:46:10,246 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 1077 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-07-24 12:46:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 12:46:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 12:46:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 12:46:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 12:46:10,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 272 [2018-07-24 12:46:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:46:10,247 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 12:46:10,247 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:46:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 12:46:10,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 12:46:10,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 12:46:10,570 WARN L169 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-07-24 12:46:10,749 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-07-24 12:46:11,823 WARN L169 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 145 DAG size of output: 73 [2018-07-24 12:46:11,835 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-07-24 12:46:11,835 INFO L421 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-07-24 12:46:11,836 INFO L421 ceAbstractionStarter]: For program point L203''(lines 203 210) no Hoare annotation was computed. [2018-07-24 12:46:11,836 INFO L421 ceAbstractionStarter]: For program point L417'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,836 INFO L421 ceAbstractionStarter]: For program point L429'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,836 INFO L421 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-07-24 12:46:11,837 INFO L421 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-07-24 12:46:11,837 INFO L421 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-07-24 12:46:11,837 INFO L421 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-07-24 12:46:11,837 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:46:11,837 INFO L421 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-07-24 12:46:11,838 INFO L421 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-07-24 12:46:11,838 INFO L421 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-07-24 12:46:11,838 INFO L421 ceAbstractionStarter]: For program point L501'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,838 INFO L421 ceAbstractionStarter]: For program point L513'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,838 INFO L421 ceAbstractionStarter]: For program point L525'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,838 INFO L421 ceAbstractionStarter]: For program point L537'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,838 INFO L421 ceAbstractionStarter]: For program point L549'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,838 INFO L421 ceAbstractionStarter]: For program point L507'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,839 INFO L421 ceAbstractionStarter]: For program point L519'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,839 INFO L421 ceAbstractionStarter]: For program point L504'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,839 INFO L421 ceAbstractionStarter]: For program point L516'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,839 INFO L421 ceAbstractionStarter]: For program point L528'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,839 INFO L421 ceAbstractionStarter]: For program point L238''(lines 238 246) no Hoare annotation was computed. [2018-07-24 12:46:11,839 INFO L421 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-07-24 12:46:11,839 INFO L421 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-07-24 12:46:11,839 INFO L421 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-07-24 12:46:11,840 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 ((.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)) (.cse3 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.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))) (let ((.cse10 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse12 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (.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))) (.cse19 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse17 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (.cse14 (and .cse3 .cse5 .cse4)) (.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))) (.cse13 (not .cse6)) (.cse15 (not .cse2)) (.cse8 (not .cse16)) (.cse18 (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0))) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse9 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9)) (.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 (not .cse4) .cse5) .cse6 .cse7 .cse8) (or .cse1 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse7 .cse13 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10)) .cse14 .cse15 .cse8) (or .cse1 .cse9 .cse16 .cse10 .cse17 .cse12) (or .cse0 .cse1 .cse13 .cse15 (and (= 7 ~__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__a17~0) .cse5 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) .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 .cse1 .cse9 .cse17 .cse18) (or .cse1 .cse9 .cse19 .cse16 .cse17) (or .cse1 .cse9 .cse16 .cse11 .cse19) (or .cse1 .cse9 (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse17) (or .cse1 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) .cse14 .cse7 .cse13 .cse15 .cse8) (or .cse18 .cse1 .cse9 .cse11)))) [2018-07-24 12:46:11,840 INFO L421 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-07-24 12:46:11,840 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-07-24 12:46:11,840 INFO L421 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-07-24 12:46:11,841 INFO L421 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-07-24 12:46:11,841 INFO L421 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-07-24 12:46:11,841 INFO L421 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-07-24 12:46:11,841 INFO L421 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-07-24 12:46:11,841 INFO L421 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-07-24 12:46:11,841 INFO L421 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-07-24 12:46:11,841 INFO L421 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-07-24 12:46:11,841 INFO L421 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-07-24 12:46:11,842 INFO L421 ceAbstractionStarter]: For program point L480'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,842 INFO L421 ceAbstractionStarter]: For program point L492'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,842 INFO L421 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-07-24 12:46:11,842 INFO L421 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-07-24 12:46:11,842 INFO L421 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-07-24 12:46:11,842 INFO L421 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-07-24 12:46:11,842 INFO L421 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-07-24 12:46:11,842 INFO L421 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-07-24 12:46:11,842 INFO L421 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-07-24 12:46:11,843 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-07-24 12:46:11,843 INFO L421 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-07-24 12:46:11,843 INFO L421 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-07-24 12:46:11,843 INFO L421 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-07-24 12:46:11,843 INFO L421 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-07-24 12:46:11,843 INFO L421 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-07-24 12:46:11,843 INFO L421 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-07-24 12:46:11,843 INFO L421 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-07-24 12:46:11,844 INFO L421 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-07-24 12:46:11,845 INFO L421 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-07-24 12:46:11,845 INFO L421 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-07-24 12:46:11,845 INFO L421 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-07-24 12:46:11,845 INFO L421 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-07-24 12:46:11,845 INFO L421 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-07-24 12:46:11,845 INFO L421 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-07-24 12:46:11,845 INFO L421 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-07-24 12:46:11,845 INFO L421 ceAbstractionStarter]: For program point L332''(lines 332 335) no Hoare annotation was computed. [2018-07-24 12:46:11,845 INFO L421 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-07-24 12:46:11,846 INFO L421 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-07-24 12:46:11,846 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-07-24 12:46:11,846 INFO L421 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-07-24 12:46:11,846 INFO L421 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-07-24 12:46:11,846 INFO L421 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-07-24 12:46:11,846 INFO L421 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-07-24 12:46:11,846 INFO L421 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-07-24 12:46:11,846 INFO L421 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-07-24 12:46:11,846 INFO L421 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-07-24 12:46:11,847 INFO L421 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-07-24 12:46:11,847 INFO L421 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-07-24 12:46:11,847 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 517) no Hoare annotation was computed. [2018-07-24 12:46:11,847 INFO L421 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-07-24 12:46:11,847 INFO L421 ceAbstractionStarter]: For program point L570'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,847 INFO L421 ceAbstractionStarter]: For program point L582'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,847 INFO L421 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-07-24 12:46:11,847 INFO L421 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-07-24 12:46:11,847 INFO L421 ceAbstractionStarter]: For program point L594'(lines 594 596) no Hoare annotation was computed. [2018-07-24 12:46:11,848 INFO L421 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-07-24 12:46:11,848 INFO L421 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-07-24 12:46:11,848 INFO L421 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-07-24 12:46:11,848 INFO L421 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-07-24 12:46:11,848 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-07-24 12:46:11,848 INFO L421 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-07-24 12:46:11,848 INFO L421 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-07-24 12:46:11,848 INFO L421 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-07-24 12:46:11,848 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-07-24 12:46:11,849 INFO L421 ceAbstractionStarter]: For program point L298''(lines 298 307) no Hoare annotation was computed. [2018-07-24 12:46:11,849 INFO L421 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-07-24 12:46:11,849 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-07-24 12:46:11,849 INFO L421 ceAbstractionStarter]: For program point L591'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,849 INFO L421 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-07-24 12:46:11,849 INFO L421 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-07-24 12:46:11,849 INFO L421 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-07-24 12:46:11,849 INFO L421 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-07-24 12:46:11,849 INFO L421 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L471'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L483'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L495'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,850 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-07-24 12:46:11,851 INFO L421 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-07-24 12:46:11,851 INFO L421 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-07-24 12:46:11,851 INFO L421 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-07-24 12:46:11,851 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-07-24 12:46:11,851 INFO L421 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-07-24 12:46:11,851 INFO L421 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-07-24 12:46:11,851 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-07-24 12:46:11,851 INFO L421 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-07-24 12:46:11,851 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L561'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L573'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L585'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L477'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L489'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,852 INFO L421 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-07-24 12:46:11,853 INFO L421 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-07-24 12:46:11,853 INFO L421 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-07-24 12:46:11,853 INFO L421 ceAbstractionStarter]: For program point L441'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,853 INFO L421 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-07-24 12:46:11,853 INFO L421 ceAbstractionStarter]: For program point L453'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,853 INFO L421 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-07-24 12:46:11,853 INFO L421 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-07-24 12:46:11,853 INFO L421 ceAbstractionStarter]: For program point L465'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,853 INFO L421 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-07-24 12:46:11,854 INFO L421 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-07-24 12:46:11,854 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-07-24 12:46:11,854 INFO L421 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-07-24 12:46:11,854 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:46:11,854 INFO L421 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-07-24 12:46:11,854 INFO L421 ceAbstractionStarter]: For program point L75''(lines 75 80) no Hoare annotation was computed. [2018-07-24 12:46:11,854 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-07-24 12:46:11,854 INFO L421 ceAbstractionStarter]: For program point L450'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,854 INFO L421 ceAbstractionStarter]: For program point L462'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,854 INFO L421 ceAbstractionStarter]: For program point L474'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L486'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L498'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-07-24 12:46:11,855 INFO L421 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L420'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L432'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L414''(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L381''(lines 381 387) no Hoare annotation was computed. [2018-07-24 12:46:11,856 INFO L421 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-07-24 12:46:11,857 INFO L421 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-07-24 12:46:11,857 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-07-24 12:46:11,857 INFO L421 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-07-24 12:46:11,857 INFO L421 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-07-24 12:46:11,857 INFO L421 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-07-24 12:46:11,857 INFO L421 ceAbstractionStarter]: For program point L83''(lines 83 89) no Hoare annotation was computed. [2018-07-24 12:46:11,857 INFO L421 ceAbstractionStarter]: For program point L543'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,857 INFO L421 ceAbstractionStarter]: For program point L555'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,857 INFO L421 ceAbstractionStarter]: For program point L567'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L579'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L576'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L588'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L540'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L552'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L564'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L444'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,858 INFO L421 ceAbstractionStarter]: For program point L456'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L468'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L338''(lines 338 347) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L315''(lines 315 326) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L262''(lines 262 274) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L510'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L522'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L534'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L546'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L558'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,859 INFO L421 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L426'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L438'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L531'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L423'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L435'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,860 INFO L421 ceAbstractionStarter]: For program point L447'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,861 INFO L421 ceAbstractionStarter]: For program point L459'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:46:11,861 INFO L421 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-07-24 12:46:11,861 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-07-24 12:46:11,861 INFO L421 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-07-24 12:46:11,861 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-07-24 12:46:11,861 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~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__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9))) [2018-07-24 12:46:11,861 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-07-24 12:46:11,861 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__a17~0 9)) (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__a28~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= ~__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:46:11,862 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-07-24 12:46:11,862 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 12:46:11,862 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 12:46:11,862 INFO L421 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-07-24 12:46:11,862 INFO L421 ceAbstractionStarter]: For program point L606'''(lines 600 617) no Hoare annotation was computed. [2018-07-24 12:46:11,862 INFO L417 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 (<= 8 ~__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__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (and (= 7 ~__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__a17~0) (= 1 ~__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__a25~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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)| 9) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8) (and .cse0 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)))) [2018-07-24 12:46:11,862 INFO L417 ceAbstractionStarter]: At program point L606''(lines 606 616) the Hoare annotation is: (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 (<= 8 ~__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__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (and (= 7 ~__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__a17~0) (= 1 ~__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__a25~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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)| 9) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8) (and .cse0 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)))) [2018-07-24 12:46:11,863 INFO L421 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-07-24 12:46:11,863 INFO L417 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (<= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= |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)) (= |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__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) [2018-07-24 12:46:11,863 INFO L421 ceAbstractionStarter]: For program point L614'(line 614) no Hoare annotation was computed. [2018-07-24 12:46:11,863 INFO L421 ceAbstractionStarter]: For program point L606(lines 606 616) no Hoare annotation was computed. [2018-07-24 12:46:11,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 12:46:11 BoogieIcfgContainer [2018-07-24 12:46:11,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 12:46:11,885 INFO L168 Benchmark]: Toolchain (without parser) took 34358.18 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 2.1 GB in the end (delta: -683.9 MB). Peak memory consumption was 478.4 MB. Max. memory is 7.1 GB. [2018-07-24 12:46:11,886 INFO L168 Benchmark]: CDTParser took 0.23 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:46:11,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 12:46:11,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.16 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:46:11,888 INFO L168 Benchmark]: Boogie Preprocessor took 221.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -859.3 MB). Peak memory consumption was 36.5 MB. Max. memory is 7.1 GB. [2018-07-24 12:46:11,889 INFO L168 Benchmark]: RCFGBuilder took 3046.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. [2018-07-24 12:46:11,893 INFO L168 Benchmark]: TraceAbstraction took 30274.62 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 386.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 402.5 MB. Max. memory is 7.1 GB. [2018-07-24 12:46:11,899 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.23 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 699.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 108.16 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 221.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -859.3 MB). Peak memory consumption was 36.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3046.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30274.62 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 386.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 402.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 517]: 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__a21 == 1) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && 8 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) || \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__a17) == 9) || ((((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)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) == 1) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) == 9) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) < 8) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && 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, 30.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1764 SDtfs, 4831 SDslu, 938 SDs, 0 SdLazy, 6747 SolverSat, 1413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2244 GetRequests, 2168 SyntacticMatches, 18 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6549occurred 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.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 150 PreInvPairs, 230 NumberOfFragments, 470 HoareAnnotationTreeSize, 150 FomulaSimplifications, 2350 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1705 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2876 NumberOfCodeBlocks, 2876 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3937 ConstructedInterpolants, 0 QuantifiedInterpolants, 2790599 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2438 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 1762/1845 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_label00_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_12-46-11-929.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label00_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_12-46-11-929.csv Received shutdown request...