java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:18:46,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:18:46,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:18:46,506 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:18:46,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:18:46,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:18:46,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:18:46,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:18:46,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:18:46,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:18:46,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:18:46,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:18:46,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:18:46,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:18:46,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:18:46,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:18:46,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:18:46,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:18:46,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:18:46,524 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:18:46,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:18:46,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:18:46,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:18:46,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:18:46,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:18:46,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:18:46,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:18:46,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:18:46,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:18:46,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:18:46,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:18:46,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:18:46,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:18:46,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:18:46,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:18:46,538 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:18:46,539 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:18:46,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:18:46,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:18:46,562 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:18:46,562 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:18:46,562 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:18:46,562 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:18:46,562 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:18:46,563 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:18:46,563 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:18:46,563 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:18:46,563 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:18:46,564 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:18:46,564 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:18:46,564 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:18:46,564 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:18:46,565 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:18:46,565 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:18:46,565 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:18:46,565 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:18:46,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:18:46,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:18:46,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:18:46,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:18:46,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:18:46,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:18:46,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:18:46,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:18:46,567 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:18:46,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:18:46,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:18:46,567 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:18:46,568 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:18:46,568 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:18:46,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:18:46,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:18:46,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:18:46,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:18:46,653 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:18:46,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-09-10 10:18:47,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3151aa2/c8655f8cf20f48958864dc0792eaf67d/FLAGa463bc58b [2018-09-10 10:18:47,311 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:18:47,312 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-09-10 10:18:47,337 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3151aa2/c8655f8cf20f48958864dc0792eaf67d/FLAGa463bc58b [2018-09-10 10:18:47,351 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3151aa2/c8655f8cf20f48958864dc0792eaf67d [2018-09-10 10:18:47,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:18:47,364 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:18:47,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:18:47,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:18:47,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:18:47,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:18:47" (1/1) ... [2018-09-10 10:18:47,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e10ba6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:47, skipping insertion in model container [2018-09-10 10:18:47,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:18:47" (1/1) ... [2018-09-10 10:18:47,663 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:18:47,985 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:18:48,006 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:18:48,131 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:18:48,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48 WrapperNode [2018-09-10 10:18:48,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:18:48,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:18:48,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:18:48,170 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:18:48,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... [2018-09-10 10:18:48,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... [2018-09-10 10:18:48,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:18:48,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:18:48,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:18:48,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:18:48,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... [2018-09-10 10:18:48,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... [2018-09-10 10:18:48,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... [2018-09-10 10:18:48,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... [2018-09-10 10:18:48,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... [2018-09-10 10:18:48,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... [2018-09-10 10:18:48,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... [2018-09-10 10:18:48,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:18:48,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:18:48,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:18:48,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:18:48,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:18:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:18:48,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:18:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:18:48,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:18:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:18:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:18:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:18:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:18:52,021 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:18:52,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:18:52 BoogieIcfgContainer [2018-09-10 10:18:52,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:18:52,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:18:52,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:18:52,029 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:18:52,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:18:47" (1/3) ... [2018-09-10 10:18:52,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5829c02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:18:52, skipping insertion in model container [2018-09-10 10:18:52,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:18:48" (2/3) ... [2018-09-10 10:18:52,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5829c02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:18:52, skipping insertion in model container [2018-09-10 10:18:52,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:18:52" (3/3) ... [2018-09-10 10:18:52,033 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label05_true-unreach-call_false-termination.c [2018-09-10 10:18:52,044 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:18:52,055 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:18:52,110 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:18:52,110 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:18:52,111 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:18:52,111 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:18:52,111 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:18:52,111 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:18:52,112 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:18:52,112 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:18:52,112 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:18:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-09-10 10:18:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-10 10:18:52,151 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:52,152 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:52,153 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash -168567709, now seen corresponding path program 1 times [2018-09-10 10:18:52,161 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:52,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:52,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:52,208 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:52,781 WARN L175 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:18:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:52,971 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:18:52,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:18:52,972 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:18:52,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:18:52,996 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:18:52,997 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:53,000 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-09-10 10:18:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:54,660 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-09-10 10:18:54,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:18:54,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-09-10 10:18:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:54,681 INFO L225 Difference]: With dead ends: 550 [2018-09-10 10:18:54,682 INFO L226 Difference]: Without dead ends: 340 [2018-09-10 10:18:54,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-10 10:18:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-09-10 10:18:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-10 10:18:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-09-10 10:18:54,777 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 101 [2018-09-10 10:18:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:54,780 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-09-10 10:18:54,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:18:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-09-10 10:18:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-10 10:18:54,787 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:54,788 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:54,788 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:54,789 INFO L82 PathProgramCache]: Analyzing trace with hash -887462874, now seen corresponding path program 1 times [2018-09-10 10:18:54,789 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:54,791 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:55,011 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:18:55,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:18:55,011 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:18:55,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:18:55,014 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:18:55,014 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:18:55,014 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-09-10 10:18:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:57,117 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-09-10 10:18:57,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:18:57,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-09-10 10:18:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:57,127 INFO L225 Difference]: With dead ends: 1075 [2018-09-10 10:18:57,127 INFO L226 Difference]: Without dead ends: 741 [2018-09-10 10:18:57,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:18:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-09-10 10:18:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-09-10 10:18:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-09-10 10:18:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-09-10 10:18:57,193 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 112 [2018-09-10 10:18:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:57,193 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-09-10 10:18:57,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:18:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-09-10 10:18:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-10 10:18:57,201 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:57,202 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:57,202 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:57,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2145610960, now seen corresponding path program 1 times [2018-09-10 10:18:57,203 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:57,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:57,204 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:57,417 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:18:57,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:18:57,417 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:18:57,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:18:57,419 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:18:57,419 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:57,421 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 3 states. [2018-09-10 10:18:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:18:59,291 INFO L93 Difference]: Finished difference Result 1890 states and 3042 transitions. [2018-09-10 10:18:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:18:59,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-09-10 10:18:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:18:59,305 INFO L225 Difference]: With dead ends: 1890 [2018-09-10 10:18:59,305 INFO L226 Difference]: Without dead ends: 1172 [2018-09-10 10:18:59,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:18:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-09-10 10:18:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1168. [2018-09-10 10:18:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-09-10 10:18:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1699 transitions. [2018-09-10 10:18:59,366 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1699 transitions. Word has length 113 [2018-09-10 10:18:59,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:18:59,367 INFO L480 AbstractCegarLoop]: Abstraction has 1168 states and 1699 transitions. [2018-09-10 10:18:59,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:18:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1699 transitions. [2018-09-10 10:18:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-10 10:18:59,372 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:18:59,373 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:18:59,373 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:18:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1850441755, now seen corresponding path program 1 times [2018-09-10 10:18:59,373 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:18:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:59,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:59,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:18:59,375 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:18:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:59,570 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:18:59,571 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:18:59,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:18:59,583 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:18:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:18:59,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:18:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:18:59,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:19:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:19:00,082 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:19:00,082 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:19:00,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:00,098 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:19:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:19:00,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:19:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 39 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:19:00,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:19:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:19:01,007 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:19:01,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 7] total 10 [2018-09-10 10:19:01,008 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:19:01,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:19:01,009 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:19:01,009 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:19:01,009 INFO L87 Difference]: Start difference. First operand 1168 states and 1699 transitions. Second operand 5 states. [2018-09-10 10:19:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:19:04,066 INFO L93 Difference]: Finished difference Result 2752 states and 4106 transitions. [2018-09-10 10:19:04,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:19:04,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-09-10 10:19:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:19:04,083 INFO L225 Difference]: With dead ends: 2752 [2018-09-10 10:19:04,084 INFO L226 Difference]: Without dead ends: 1590 [2018-09-10 10:19:04,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 567 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:19:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-09-10 10:19:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1590. [2018-09-10 10:19:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2018-09-10 10:19:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2341 transitions. [2018-09-10 10:19:04,158 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2341 transitions. Word has length 145 [2018-09-10 10:19:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:19:04,159 INFO L480 AbstractCegarLoop]: Abstraction has 1590 states and 2341 transitions. [2018-09-10 10:19:04,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:19:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2341 transitions. [2018-09-10 10:19:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-10 10:19:04,168 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:19:04,168 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:19:04,168 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:19:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2017901459, now seen corresponding path program 1 times [2018-09-10 10:19:04,169 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:19:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:19:04,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:19:04,170 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:19:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:19:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:19:04,337 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:19:04,337 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:19:04,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:04,345 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:19:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:19:04,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:19:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:19:04,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:19:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:19:04,785 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:19:04,786 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:19:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:04,812 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:19:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:19:04,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:19:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:19:05,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:19:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:19:05,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:19:05,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 4, 4] total 13 [2018-09-10 10:19:05,522 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:19:05,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:19:05,523 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:19:05,523 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:19:05,524 INFO L87 Difference]: Start difference. First operand 1590 states and 2341 transitions. Second operand 8 states. [2018-09-10 10:19:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:19:09,299 INFO L93 Difference]: Finished difference Result 4091 states and 6329 transitions. [2018-09-10 10:19:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-10 10:19:09,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 149 [2018-09-10 10:19:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:19:09,321 INFO L225 Difference]: With dead ends: 4091 [2018-09-10 10:19:09,321 INFO L226 Difference]: Without dead ends: 2507 [2018-09-10 10:19:09,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 594 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2018-09-10 10:19:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2018-09-10 10:19:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2126. [2018-09-10 10:19:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2018-09-10 10:19:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 2816 transitions. [2018-09-10 10:19:09,431 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 2816 transitions. Word has length 149 [2018-09-10 10:19:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:19:09,431 INFO L480 AbstractCegarLoop]: Abstraction has 2126 states and 2816 transitions. [2018-09-10 10:19:09,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:19:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2816 transitions. [2018-09-10 10:19:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-10 10:19:09,440 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:19:09,440 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:19:09,440 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:19:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash -328336473, now seen corresponding path program 1 times [2018-09-10 10:19:09,441 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:19:09,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:19:09,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:09,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:19:09,442 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:19:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:19:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:19:09,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:19:09,609 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:19:09,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:09,618 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:19:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:19:09,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:19:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-10 10:19:09,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:19:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-10 10:19:10,134 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:19:10,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 9 [2018-09-10 10:19:10,135 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:19:10,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:19:10,136 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:19:10,136 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:19:10,136 INFO L87 Difference]: Start difference. First operand 2126 states and 2816 transitions. Second operand 4 states. [2018-09-10 10:19:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:19:11,407 INFO L93 Difference]: Finished difference Result 5800 states and 7847 transitions. [2018-09-10 10:19:11,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:19:11,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-09-10 10:19:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:19:11,430 INFO L225 Difference]: With dead ends: 5800 [2018-09-10 10:19:11,430 INFO L226 Difference]: Without dead ends: 3680 [2018-09-10 10:19:11,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 331 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:19:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2018-09-10 10:19:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3671. [2018-09-10 10:19:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3671 states. [2018-09-10 10:19:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4832 transitions. [2018-09-10 10:19:11,550 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4832 transitions. Word has length 169 [2018-09-10 10:19:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:19:11,551 INFO L480 AbstractCegarLoop]: Abstraction has 3671 states and 4832 transitions. [2018-09-10 10:19:11,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:19:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4832 transitions. [2018-09-10 10:19:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-10 10:19:11,564 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:19:11,564 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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] [2018-09-10 10:19:11,564 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:19:11,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1890605676, now seen corresponding path program 1 times [2018-09-10 10:19:11,565 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:19:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:19:11,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:19:11,566 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:19:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:19:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:19:11,748 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:19:11,748 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:19:11,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:11,757 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:19:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:19:11,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:19:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-09-10 10:19:11,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:19:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:19:12,192 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:19:12,192 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:19:12,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:19:12,207 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:19:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:19:12,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:19:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-09-10 10:19:12,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:19:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:19:12,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:19:12,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 17 [2018-09-10 10:19:12,746 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:19:12,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:19:12,747 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:19:12,747 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:19:12,747 INFO L87 Difference]: Start difference. First operand 3671 states and 4832 transitions. Second operand 8 states. [2018-09-10 10:19:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:19:17,379 INFO L93 Difference]: Finished difference Result 9030 states and 12517 transitions. [2018-09-10 10:19:17,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-10 10:19:17,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2018-09-10 10:19:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:19:17,380 INFO L225 Difference]: With dead ends: 9030 [2018-09-10 10:19:17,382 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:19:17,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2018-09-10 10:19:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:19:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:19:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:19:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:19:17,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 181 [2018-09-10 10:19:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:19:17,422 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:19:17,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:19:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:19:17,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:19:17,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:19:17,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,696 WARN L175 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 102 [2018-09-10 10:19:17,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:19:17,829 WARN L175 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 102 [2018-09-10 10:19:17,994 WARN L175 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 10:19:18,358 WARN L175 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-09-10 10:19:20,137 WARN L175 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 138 DAG size of output: 66 [2018-09-10 10:19:20,685 WARN L175 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 48 [2018-09-10 10:19:21,084 WARN L175 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 48 [2018-09-10 10:19:21,087 INFO L426 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-09-10 10:19:21,088 INFO L426 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-09-10 10:19:21,088 INFO L426 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,088 INFO L426 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,088 INFO L426 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,088 INFO L426 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,088 INFO L426 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,088 INFO L426 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,089 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-09-10 10:19:21,089 INFO L426 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-09-10 10:19:21,089 INFO L426 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-09-10 10:19:21,089 INFO L426 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-09-10 10:19:21,089 INFO L426 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-09-10 10:19:21,089 INFO L426 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-09-10 10:19:21,089 INFO L426 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-09-10 10:19:21,089 INFO L426 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-09-10 10:19:21,090 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-09-10 10:19:21,090 INFO L426 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-09-10 10:19:21,090 INFO L426 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,090 INFO L426 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,090 INFO L426 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,090 INFO L426 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,090 INFO L426 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,090 INFO L426 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,091 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-09-10 10:19:21,091 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-09-10 10:19:21,091 INFO L426 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-09-10 10:19:21,091 INFO L426 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-09-10 10:19:21,091 INFO L426 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-09-10 10:19:21,091 INFO L426 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-09-10 10:19:21,091 INFO L426 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-09-10 10:19:21,091 INFO L426 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-09-10 10:19:21,091 INFO L426 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-09-10 10:19:21,092 INFO L426 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-09-10 10:19:21,092 INFO L426 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-09-10 10:19:21,092 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-09-10 10:19:21,092 INFO L426 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-09-10 10:19:21,092 INFO L426 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-09-10 10:19:21,092 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,092 INFO L426 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-09-10 10:19:21,092 INFO L426 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,093 INFO L426 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,093 INFO L426 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,093 INFO L426 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,093 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,093 INFO L426 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,093 INFO L426 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-09-10 10:19:21,093 INFO L426 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-09-10 10:19:21,093 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2018-09-10 10:19:21,094 INFO L426 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-09-10 10:19:21,094 INFO L426 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-09-10 10:19:21,094 INFO L426 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-09-10 10:19:21,094 INFO L426 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-09-10 10:19:21,094 INFO L426 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-09-10 10:19:21,094 INFO L426 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-09-10 10:19:21,094 INFO L426 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-09-10 10:19:21,094 INFO L426 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,094 INFO L426 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,095 INFO L426 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,095 INFO L426 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,095 INFO L426 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,095 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-09-10 10:19:21,095 INFO L426 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-09-10 10:19:21,095 INFO L426 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-09-10 10:19:21,095 INFO L426 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-09-10 10:19:21,095 INFO L426 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-09-10 10:19:21,095 INFO L426 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,096 INFO L426 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,097 INFO L426 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,097 INFO L426 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,097 INFO L426 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-09-10 10:19:21,097 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-09-10 10:19:21,097 INFO L426 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-09-10 10:19:21,097 INFO L426 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-09-10 10:19:21,097 INFO L426 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-09-10 10:19:21,097 INFO L426 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-09-10 10:19:21,097 INFO L426 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-09-10 10:19:21,098 INFO L426 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-09-10 10:19:21,098 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-09-10 10:19:21,098 INFO L426 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,098 INFO L426 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,098 INFO L426 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,098 INFO L426 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,098 INFO L426 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-09-10 10:19:21,098 INFO L426 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,098 INFO L426 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-09-10 10:19:21,099 INFO L426 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-09-10 10:19:21,100 INFO L426 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,101 INFO L426 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,102 INFO L426 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-09-10 10:19:21,102 INFO L426 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-09-10 10:19:21,102 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-09-10 10:19:21,102 INFO L426 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-09-10 10:19:21,102 INFO L426 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-09-10 10:19:21,102 INFO L426 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-09-10 10:19:21,102 INFO L426 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-09-10 10:19:21,102 INFO L426 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-09-10 10:19:21,102 INFO L426 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,103 INFO L426 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-09-10 10:19:21,104 INFO L426 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-09-10 10:19:21,104 INFO L426 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-09-10 10:19:21,104 INFO L426 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-09-10 10:19:21,104 INFO L426 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-09-10 10:19:21,104 INFO L426 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-09-10 10:19:21,104 INFO L426 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-09-10 10:19:21,104 INFO L426 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-09-10 10:19:21,104 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-09-10 10:19:21,104 INFO L426 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,105 INFO L426 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-09-10 10:19:21,106 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-09-10 10:19:21,106 INFO L426 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-09-10 10:19:21,106 INFO L426 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-09-10 10:19:21,106 INFO L426 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-09-10 10:19:21,106 INFO L426 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-09-10 10:19:21,106 INFO L426 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-09-10 10:19:21,106 INFO L426 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-09-10 10:19:21,106 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-09-10 10:19:21,106 INFO L426 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-09-10 10:19:21,107 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-09-10 10:19:21,107 INFO L426 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-09-10 10:19:21,107 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-09-10 10:19:21,107 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-09-10 10:19:21,107 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)|)) (.cse7 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)|)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)|)) (.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse11 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (let ((.cse16 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 15)) (.cse15 (<= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)) (.cse0 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13)) (.cse5 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)|)) (.cse3 (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (.cse13 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1))) (.cse1 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)| 1))) (.cse2 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1))) (.cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6)) (.cse14 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1))) (.cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse5 .cse4 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (or (and .cse7 .cse8 .cse9 .cse12 .cse10 .cse11) .cse13 .cse2 .cse5 .cse14) (or .cse15 .cse1 .cse2 .cse16 .cse4) (or .cse2 .cse16 .cse5 .cse15) (or .cse0 .cse2 .cse5 .cse3) (or .cse1 (and (and .cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) .cse7 .cse10) .cse8 .cse9) (< 13 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)|) (let ((.cse17 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|))) (and (or .cse13 .cse17) (or .cse4 .cse17)))) (or .cse13 .cse1 .cse2 .cse4 .cse14 (and .cse9 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0) .cse7 .cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse11))))) [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-09-10 10:19:21,108 INFO L426 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-09-10 10:19:21,109 INFO L426 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-09-10 10:19:21,109 INFO L426 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-09-10 10:19:21,109 INFO L426 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-09-10 10:19:21,109 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-09-10 10:19:21,109 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-09-10 10:19:21,109 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-09-10 10:19:21,109 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:19:21,109 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)|) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)|) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)|) (or (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) [2018-09-10 10:19:21,109 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:19:21,110 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:19:21,110 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6)) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)) [2018-09-10 10:19:21,110 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:19:21,110 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:19:21,110 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)|) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)|) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)|) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1))) [2018-09-10 10:19:21,110 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:19:21,110 INFO L422 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 0)) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6))) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1)) (and .cse4 .cse5 .cse1 .cse2 .cse3) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1)) (and .cse6 .cse0 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)|) (and .cse4 (and .cse6 .cse5 .cse3)) (and .cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13) (let ((.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0))) (or (and .cse7 .cse5) (and .cse7 .cse1)))) (and .cse0 .cse5 .cse3))) [2018-09-10 10:19:21,111 INFO L426 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-09-10 10:19:21,111 INFO L426 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-09-10 10:19:21,111 INFO L426 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-09-10 10:19:21,111 INFO L422 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)) (.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 0)) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6))) (.cse3 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0)| 13) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 1)) (and .cse4 .cse5 .cse1 .cse2 .cse3) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 1)) (and .cse6 .cse0 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0)| 6) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0)| 1)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0)|) (and .cse4 (and .cse6 .cse5 .cse3)) (and .cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13) (let ((.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0))) (or (and .cse7 .cse5) (and .cse7 .cse1)))) (and .cse0 .cse5 .cse3))) [2018-09-10 10:19:21,111 INFO L426 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-09-10 10:19:21,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:19:21 BoogieIcfgContainer [2018-09-10 10:19:21,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:19:21,133 INFO L168 Benchmark]: Toolchain (without parser) took 33771.98 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.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 890.5 MB. Max. memory is 7.1 GB. [2018-09-10 10:19:21,134 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:19:21,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.70 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-09-10 10:19:21,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:19:21,136 INFO L168 Benchmark]: Boogie Preprocessor took 220.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -869.3 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:19:21,137 INFO L168 Benchmark]: RCFGBuilder took 3551.62 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: 116.8 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. [2018-09-10 10:19:21,138 INFO L168 Benchmark]: TraceAbstraction took 29108.07 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 427.3 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -375.9 MB). Peak memory consumption was 817.9 MB. Max. memory is 7.1 GB. [2018-09-10 10:19:21,143 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.17 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 803.70 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 81.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 220.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -869.3 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3551.62 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: 116.8 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29108.07 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 427.3 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -375.9 MB). Peak memory consumption was 817.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8) == 13) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 1)) || ((((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || !(\old(__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__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) == 6) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20) == 1)) || 0 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7)) || (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6)) && 1 == __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__a7 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 <= 13) && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20)))) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 29.0s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 18.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 671 SDtfs, 4769 SDslu, 881 SDs, 0 SdLazy, 8128 SolverSat, 1590 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2341 GetRequests, 2233 SyntacticMatches, 20 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3671occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 411 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 130 PreInvPairs, 264 NumberOfFragments, 585 HoareAnnotationTreeSize, 130 FomulaSimplifications, 6234 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6034 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2089 NumberOfCodeBlocks, 2089 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3187 ConstructedInterpolants, 0 QuantifiedInterpolants, 1168403 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3213 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 1114/1275 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label05_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-19-21-161.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label05_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-19-21-161.csv Received shutdown request...