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/Problem16_label13_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 12:17:26,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 12:17:26,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 12:17:26,534 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 12:17:26,534 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 12:17:26,535 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 12:17:26,536 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 12:17:26,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 12:17:26,540 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 12:17:26,541 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 12:17:26,541 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 12:17:26,542 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 12:17:26,543 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 12:17:26,544 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 12:17:26,545 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 12:17:26,546 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 12:17:26,547 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 12:17:26,549 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 12:17:26,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 12:17:26,556 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 12:17:26,561 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 12:17:26,562 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 12:17:26,568 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 12:17:26,568 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 12:17:26,568 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 12:17:26,572 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 12:17:26,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 12:17:26,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 12:17:26,577 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 12:17:26,578 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 12:17:26,578 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 12:17:26,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 12:17:26,579 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 12:17:26,582 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 12:17:26,583 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 12:17:26,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 12:17:26,586 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 12:17:26,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 12:17:26,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 12:17:26,617 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 12:17:26,617 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 12:17:26,617 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 12:17:26,617 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 12:17:26,618 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 12:17:26,618 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 12:17:26,618 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 12:17:26,618 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 12:17:26,618 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 12:17:26,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 12:17:26,619 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 12:17:26,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 12:17:26,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 12:17:26,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 12:17:26,620 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 12:17:26,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 12:17:26,621 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 12:17:26,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 12:17:26,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 12:17:26,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 12:17:26,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 12:17:26,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:17:26,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 12:17:26,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 12:17:26,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 12:17:26,622 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 12:17:26,623 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 12:17:26,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 12:17:26,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 12:17:26,623 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 12:17:26,623 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 12:17:26,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 12:17:26,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 12:17:26,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 12:17:26,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 12:17:26,692 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 12:17:26,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label13_true-unreach-call.c [2018-09-10 12:17:27,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e46461c/ef8efdd9bb4947c4958a2a8841ed6b73/FLAGf8f509ee4 [2018-09-10 12:17:27,473 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 12:17:27,474 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label13_true-unreach-call.c [2018-09-10 12:17:27,500 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e46461c/ef8efdd9bb4947c4958a2a8841ed6b73/FLAGf8f509ee4 [2018-09-10 12:17:27,515 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e46461c/ef8efdd9bb4947c4958a2a8841ed6b73 [2018-09-10 12:17:27,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 12:17:27,530 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 12:17:27,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 12:17:27,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 12:17:27,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 12:17:27,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:17:27" (1/1) ... [2018-09-10 12:17:27,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6652310c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:27, skipping insertion in model container [2018-09-10 12:17:27,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:17:27" (1/1) ... [2018-09-10 12:17:27,801 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 12:17:28,328 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:17:28,347 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 12:17:28,685 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:17:28,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28 WrapperNode [2018-09-10 12:17:28,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 12:17:28,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 12:17:28,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 12:17:28,794 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 12:17:28,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (1/1) ... [2018-09-10 12:17:28,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (1/1) ... [2018-09-10 12:17:28,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 12:17:28,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 12:17:28,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 12:17:28,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 12:17:29,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (1/1) ... [2018-09-10 12:17:29,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (1/1) ... [2018-09-10 12:17:29,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (1/1) ... [2018-09-10 12:17:29,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (1/1) ... [2018-09-10 12:17:29,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (1/1) ... [2018-09-10 12:17:29,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (1/1) ... [2018-09-10 12:17:29,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (1/1) ... [2018-09-10 12:17:29,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 12:17:29,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 12:17:29,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 12:17:29,505 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 12:17:29,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (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 12:17:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 12:17:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 12:17:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 12:17:29,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 12:17:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 12:17:29,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 12:17:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 12:17:29,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 12:17:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-10 12:17:29,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-10 12:17:37,334 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 12:17:37,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:17:37 BoogieIcfgContainer [2018-09-10 12:17:37,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 12:17:37,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 12:17:37,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 12:17:37,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 12:17:37,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:17:27" (1/3) ... [2018-09-10 12:17:37,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583e0a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:17:37, skipping insertion in model container [2018-09-10 12:17:37,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:17:28" (2/3) ... [2018-09-10 12:17:37,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583e0a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:17:37, skipping insertion in model container [2018-09-10 12:17:37,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:17:37" (3/3) ... [2018-09-10 12:17:37,346 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label13_true-unreach-call.c [2018-09-10 12:17:37,356 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 12:17:37,365 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 12:17:37,424 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 12:17:37,425 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 12:17:37,425 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 12:17:37,426 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 12:17:37,426 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 12:17:37,426 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 12:17:37,426 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 12:17:37,426 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 12:17:37,426 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 12:17:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-09-10 12:17:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-10 12:17:37,484 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:37,485 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] [2018-09-10 12:17:37,486 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1606600687, now seen corresponding path program 1 times [2018-09-10 12:17:37,493 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:37,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:37,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:37,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:37,546 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:37,979 WARN L175 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:17:38,019 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 12:17:38,021 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:38,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 12:17:38,022 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:38,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:17:38,043 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:17:38,044 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:17:38,047 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-09-10 12:17:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:41,424 INFO L93 Difference]: Finished difference Result 1156 states and 2144 transitions. [2018-09-10 12:17:41,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:17:41,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-09-10 12:17:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:41,451 INFO L225 Difference]: With dead ends: 1156 [2018-09-10 12:17:41,452 INFO L226 Difference]: Without dead ends: 744 [2018-09-10 12:17:41,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:17:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-09-10 12:17:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2018-09-10 12:17:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-09-10 12:17:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1317 transitions. [2018-09-10 12:17:41,569 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1317 transitions. Word has length 63 [2018-09-10 12:17:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:41,570 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1317 transitions. [2018-09-10 12:17:41,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:17:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1317 transitions. [2018-09-10 12:17:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-10 12:17:41,579 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:41,579 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:17:41,580 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1205552270, now seen corresponding path program 1 times [2018-09-10 12:17:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:41,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:41,582 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:41,944 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:41,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:17:41,944 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:41,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:17:41,946 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:17:41,947 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:41,947 INFO L87 Difference]: Start difference. First operand 744 states and 1317 transitions. Second operand 6 states. [2018-09-10 12:17:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:49,466 INFO L93 Difference]: Finished difference Result 2840 states and 5175 transitions. [2018-09-10 12:17:49,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:49,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-09-10 12:17:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:49,496 INFO L225 Difference]: With dead ends: 2840 [2018-09-10 12:17:49,496 INFO L226 Difference]: Without dead ends: 2102 [2018-09-10 12:17:49,505 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 12:17:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2018-09-10 12:17:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2081. [2018-09-10 12:17:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-09-10 12:17:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3312 transitions. [2018-09-10 12:17:49,614 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3312 transitions. Word has length 139 [2018-09-10 12:17:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:49,614 INFO L480 AbstractCegarLoop]: Abstraction has 2081 states and 3312 transitions. [2018-09-10 12:17:49,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:17:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3312 transitions. [2018-09-10 12:17:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-10 12:17:49,619 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:49,620 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:17:49,620 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash -306855750, now seen corresponding path program 1 times [2018-09-10 12:17:49,620 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:49,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:49,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:49,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:49,622 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:49,916 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:49,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:17:49,916 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:49,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:17:49,917 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:17:49,917 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:49,917 INFO L87 Difference]: Start difference. First operand 2081 states and 3312 transitions. Second operand 6 states. [2018-09-10 12:17:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:55,782 INFO L93 Difference]: Finished difference Result 4872 states and 7867 transitions. [2018-09-10 12:17:55,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:55,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-09-10 12:17:55,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:55,800 INFO L225 Difference]: With dead ends: 4872 [2018-09-10 12:17:55,800 INFO L226 Difference]: Without dead ends: 2797 [2018-09-10 12:17:55,811 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 12:17:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2018-09-10 12:17:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2772. [2018-09-10 12:17:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2018-09-10 12:17:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 4108 transitions. [2018-09-10 12:17:55,900 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 4108 transitions. Word has length 145 [2018-09-10 12:17:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:55,901 INFO L480 AbstractCegarLoop]: Abstraction has 2772 states and 4108 transitions. [2018-09-10 12:17:55,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:17:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 4108 transitions. [2018-09-10 12:17:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-10 12:17:55,907 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:55,907 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:17:55,907 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash 242004121, now seen corresponding path program 1 times [2018-09-10 12:17:55,908 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:55,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:55,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:55,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:55,909 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:17:56,114 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:17:56,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:17:56,114 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:17:56,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:17:56,115 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:17:56,115 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:17:56,115 INFO L87 Difference]: Start difference. First operand 2772 states and 4108 transitions. Second operand 6 states. [2018-09-10 12:17:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:17:59,571 INFO L93 Difference]: Finished difference Result 7301 states and 11345 transitions. [2018-09-10 12:17:59,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:17:59,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-09-10 12:17:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:17:59,599 INFO L225 Difference]: With dead ends: 7301 [2018-09-10 12:17:59,600 INFO L226 Difference]: Without dead ends: 4535 [2018-09-10 12:17:59,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:17:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2018-09-10 12:17:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4515. [2018-09-10 12:17:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4515 states. [2018-09-10 12:17:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6567 transitions. [2018-09-10 12:17:59,720 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6567 transitions. Word has length 148 [2018-09-10 12:17:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:17:59,721 INFO L480 AbstractCegarLoop]: Abstraction has 4515 states and 6567 transitions. [2018-09-10 12:17:59,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:17:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6567 transitions. [2018-09-10 12:17:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-10 12:17:59,724 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:17:59,724 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:17:59,724 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:17:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash -216487038, now seen corresponding path program 1 times [2018-09-10 12:17:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:17:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:59,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:17:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:17:59,726 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:17:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:17:59,973 WARN L175 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:18:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:00,180 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:18:00,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:18:00,180 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:00,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:18:00,181 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:18:00,182 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:18:00,182 INFO L87 Difference]: Start difference. First operand 4515 states and 6567 transitions. Second operand 6 states. [2018-09-10 12:18:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:03,579 INFO L93 Difference]: Finished difference Result 9747 states and 14265 transitions. [2018-09-10 12:18:03,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:18:03,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-09-10 12:18:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:03,607 INFO L225 Difference]: With dead ends: 9747 [2018-09-10 12:18:03,608 INFO L226 Difference]: Without dead ends: 5238 [2018-09-10 12:18:03,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:18:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2018-09-10 12:18:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 5224. [2018-09-10 12:18:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-09-10 12:18:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 6941 transitions. [2018-09-10 12:18:03,756 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 6941 transitions. Word has length 149 [2018-09-10 12:18:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:03,756 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 6941 transitions. [2018-09-10 12:18:03,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:18:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 6941 transitions. [2018-09-10 12:18:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-10 12:18:03,759 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:03,759 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:18:03,760 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:03,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1968107438, now seen corresponding path program 1 times [2018-09-10 12:18:03,760 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:03,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:03,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:03,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:03,762 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:04,013 WARN L175 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:18:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 12:18:04,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:04,177 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 12:18:04,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:04,186 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:04,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:04,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:18:04,693 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:18:04,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-09-10 12:18:04,694 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:04,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:18:04,695 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:18:04,695 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:18:04,695 INFO L87 Difference]: Start difference. First operand 5224 states and 6941 transitions. Second operand 3 states. [2018-09-10 12:18:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:09,041 INFO L93 Difference]: Finished difference Result 13145 states and 17750 transitions. [2018-09-10 12:18:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:18:09,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-09-10 12:18:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:09,091 INFO L225 Difference]: With dead ends: 13145 [2018-09-10 12:18:09,091 INFO L226 Difference]: Without dead ends: 7927 [2018-09-10 12:18:09,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 309 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:18:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2018-09-10 12:18:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 7927. [2018-09-10 12:18:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7927 states. [2018-09-10 12:18:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7927 states to 7927 states and 10091 transitions. [2018-09-10 12:18:09,320 INFO L78 Accepts]: Start accepts. Automaton has 7927 states and 10091 transitions. Word has length 155 [2018-09-10 12:18:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:09,321 INFO L480 AbstractCegarLoop]: Abstraction has 7927 states and 10091 transitions. [2018-09-10 12:18:09,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:18:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 10091 transitions. [2018-09-10 12:18:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-09-10 12:18:09,337 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:09,338 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:18:09,338 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1826999409, now seen corresponding path program 1 times [2018-09-10 12:18:09,339 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:09,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:09,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:09,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:09,340 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:10,005 WARN L175 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-10 12:18:10,254 WARN L175 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-09-10 12:18:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 272 proven. 115 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-09-10 12:18:10,951 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:10,951 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:10,959 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:11,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 386 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:18:11,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 386 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:18:11,754 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:11,754 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:18:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:11,771 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:12,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 386 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:18:12,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 386 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-09-10 12:18:12,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:18:12,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 20 [2018-09-10 12:18:12,768 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:18:12,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 12:18:12,770 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 12:18:12,770 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-09-10 12:18:12,771 INFO L87 Difference]: Start difference. First operand 7927 states and 10091 transitions. Second operand 13 states. [2018-09-10 12:18:13,851 WARN L175 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-09-10 12:18:17,275 WARN L175 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2018-09-10 12:18:18,688 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-09-10 12:18:22,385 WARN L175 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-09-10 12:18:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:27,420 INFO L93 Difference]: Finished difference Result 21678 states and 28214 transitions. [2018-09-10 12:18:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-10 12:18:27,420 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 410 [2018-09-10 12:18:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:27,486 INFO L225 Difference]: With dead ends: 21678 [2018-09-10 12:18:27,487 INFO L226 Difference]: Without dead ends: 13757 [2018-09-10 12:18:27,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1708 GetRequests, 1657 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=597, Invalid=1953, Unknown=0, NotChecked=0, Total=2550 [2018-09-10 12:18:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13757 states. [2018-09-10 12:18:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13757 to 13338. [2018-09-10 12:18:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13338 states. [2018-09-10 12:18:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13338 states to 13338 states and 16218 transitions. [2018-09-10 12:18:27,853 INFO L78 Accepts]: Start accepts. Automaton has 13338 states and 16218 transitions. Word has length 410 [2018-09-10 12:18:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:27,854 INFO L480 AbstractCegarLoop]: Abstraction has 13338 states and 16218 transitions. [2018-09-10 12:18:27,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 12:18:27,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13338 states and 16218 transitions. [2018-09-10 12:18:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-09-10 12:18:27,904 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:27,905 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:27,906 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2036582282, now seen corresponding path program 1 times [2018-09-10 12:18:27,906 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:27,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:27,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:27,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:27,908 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 421 proven. 115 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-09-10 12:18:29,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:29,150 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:29,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:29,161 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:29,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 683 proven. 2 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-09-10 12:18:29,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 421 proven. 115 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-09-10 12:18:30,118 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:30,119 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:18:30,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:30,136 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:30,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 683 proven. 2 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-09-10 12:18:31,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 421 proven. 115 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-09-10 12:18:31,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:18:31,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:18:31,757 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:18:31,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:18:31,759 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:18:31,759 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:18:31,759 INFO L87 Difference]: Start difference. First operand 13338 states and 16218 transitions. Second operand 9 states. [2018-09-10 12:18:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:39,136 INFO L93 Difference]: Finished difference Result 28357 states and 35040 transitions. [2018-09-10 12:18:39,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 12:18:39,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 642 [2018-09-10 12:18:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:39,202 INFO L225 Difference]: With dead ends: 28357 [2018-09-10 12:18:39,202 INFO L226 Difference]: Without dead ends: 15044 [2018-09-10 12:18:39,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2584 GetRequests, 2564 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-09-10 12:18:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15044 states. [2018-09-10 12:18:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15044 to 15026. [2018-09-10 12:18:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15026 states. [2018-09-10 12:18:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15026 states to 15026 states and 17992 transitions. [2018-09-10 12:18:39,779 INFO L78 Accepts]: Start accepts. Automaton has 15026 states and 17992 transitions. Word has length 642 [2018-09-10 12:18:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:39,782 INFO L480 AbstractCegarLoop]: Abstraction has 15026 states and 17992 transitions. [2018-09-10 12:18:39,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:18:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 15026 states and 17992 transitions. [2018-09-10 12:18:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-09-10 12:18:39,831 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:39,832 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:39,836 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:39,837 INFO L82 PathProgramCache]: Analyzing trace with hash 960472045, now seen corresponding path program 1 times [2018-09-10 12:18:39,837 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:39,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:39,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:39,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:39,838 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 558 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:40,873 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:40,873 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 12:18:40,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:40,889 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:41,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 558 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:41,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 558 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:42,265 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:42,265 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 12:18:42,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:42,281 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:42,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 558 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:43,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 558 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-10 12:18:43,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:18:43,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:18:43,389 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:18:43,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:18:43,392 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:18:43,393 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:18:43,393 INFO L87 Difference]: Start difference. First operand 15026 states and 17992 transitions. Second operand 9 states. [2018-09-10 12:18:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:53,267 INFO L93 Difference]: Finished difference Result 31029 states and 38398 transitions. [2018-09-10 12:18:53,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-10 12:18:53,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 643 [2018-09-10 12:18:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:53,344 INFO L225 Difference]: With dead ends: 31029 [2018-09-10 12:18:53,345 INFO L226 Difference]: Without dead ends: 16028 [2018-09-10 12:18:53,391 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2600 GetRequests, 2574 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2018-09-10 12:18:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16028 states. [2018-09-10 12:18:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16028 to 15738. [2018-09-10 12:18:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15738 states. [2018-09-10 12:18:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15738 states to 15738 states and 18046 transitions. [2018-09-10 12:18:53,734 INFO L78 Accepts]: Start accepts. Automaton has 15738 states and 18046 transitions. Word has length 643 [2018-09-10 12:18:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:53,736 INFO L480 AbstractCegarLoop]: Abstraction has 15738 states and 18046 transitions. [2018-09-10 12:18:53,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:18:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15738 states and 18046 transitions. [2018-09-10 12:18:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2018-09-10 12:18:53,791 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:53,792 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:53,793 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash -475832329, now seen corresponding path program 1 times [2018-09-10 12:18:53,793 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:53,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:53,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:53,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:53,797 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:18:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:54,351 WARN L175 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:18:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 511 proven. 279 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-10 12:18:55,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:18:55,161 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:18:55,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:55,171 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:18:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:18:55,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:18:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-09-10 12:18:55,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:18:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-09-10 12:18:55,994 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:18:55,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-09-10 12:18:55,994 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:18:55,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:18:55,995 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:18:55,995 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:18:55,995 INFO L87 Difference]: Start difference. First operand 15738 states and 18046 transitions. Second operand 3 states. [2018-09-10 12:18:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:18:59,599 INFO L93 Difference]: Finished difference Result 30775 states and 35314 transitions. [2018-09-10 12:18:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:18:59,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 671 [2018-09-10 12:18:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:18:59,646 INFO L225 Difference]: With dead ends: 30775 [2018-09-10 12:18:59,646 INFO L226 Difference]: Without dead ends: 15738 [2018-09-10 12:18:59,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1355 GetRequests, 1343 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:18:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15738 states. [2018-09-10 12:18:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15738 to 15726. [2018-09-10 12:18:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15726 states. [2018-09-10 12:18:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15726 states to 15726 states and 17505 transitions. [2018-09-10 12:18:59,914 INFO L78 Accepts]: Start accepts. Automaton has 15726 states and 17505 transitions. Word has length 671 [2018-09-10 12:18:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:18:59,916 INFO L480 AbstractCegarLoop]: Abstraction has 15726 states and 17505 transitions. [2018-09-10 12:18:59,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:18:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 15726 states and 17505 transitions. [2018-09-10 12:18:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2018-09-10 12:18:59,960 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:18:59,960 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:18:59,961 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:18:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash 544776921, now seen corresponding path program 1 times [2018-09-10 12:18:59,961 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:18:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:59,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:18:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:18:59,963 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:19:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 1006 proven. 156 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-09-10 12:19:01,399 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:19:01,399 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:19:01,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:01,420 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:19:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:01,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:19:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 796 proven. 2 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-09-10 12:19:02,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:19:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 796 proven. 2 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-09-10 12:19:02,910 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:19:02,911 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 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:19:02,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:02,927 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:19:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:03,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:19:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 1006 proven. 6 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-09-10 12:19:04,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:19:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 1008 proven. 4 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2018-09-10 12:19:04,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:19:04,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:19:04,821 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:19:04,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:19:04,823 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:19:04,823 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:19:04,823 INFO L87 Difference]: Start difference. First operand 15726 states and 17505 transitions. Second operand 9 states. [2018-09-10 12:19:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:19:09,579 INFO L93 Difference]: Finished difference Result 34920 states and 39252 transitions. [2018-09-10 12:19:09,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-10 12:19:09,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 850 [2018-09-10 12:19:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:19:09,640 INFO L225 Difference]: With dead ends: 34920 [2018-09-10 12:19:09,640 INFO L226 Difference]: Without dead ends: 15069 [2018-09-10 12:19:09,681 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3422 GetRequests, 3401 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-09-10 12:19:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15069 states. [2018-09-10 12:19:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15069 to 14574. [2018-09-10 12:19:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14574 states. [2018-09-10 12:19:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14574 states to 14574 states and 15314 transitions. [2018-09-10 12:19:09,967 INFO L78 Accepts]: Start accepts. Automaton has 14574 states and 15314 transitions. Word has length 850 [2018-09-10 12:19:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:19:09,974 INFO L480 AbstractCegarLoop]: Abstraction has 14574 states and 15314 transitions. [2018-09-10 12:19:09,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:19:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 14574 states and 15314 transitions. [2018-09-10 12:19:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1149 [2018-09-10 12:19:10,010 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:19:10,011 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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 12:19:10,011 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:19:10,012 INFO L82 PathProgramCache]: Analyzing trace with hash 291485261, now seen corresponding path program 1 times [2018-09-10 12:19:10,012 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:19:10,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:10,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:10,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:10,013 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:19:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 2480 trivial. 0 not checked. [2018-09-10 12:19:11,562 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:19:11,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:19:11,562 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:19:11,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:19:11,563 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:19:11,564 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:19:11,564 INFO L87 Difference]: Start difference. First operand 14574 states and 15314 transitions. Second operand 4 states. [2018-09-10 12:19:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:19:13,993 INFO L93 Difference]: Finished difference Result 27740 states and 29145 transitions. [2018-09-10 12:19:13,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:19:13,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1148 [2018-09-10 12:19:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:19:14,036 INFO L225 Difference]: With dead ends: 27740 [2018-09-10 12:19:14,037 INFO L226 Difference]: Without dead ends: 14179 [2018-09-10 12:19:14,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:19:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14179 states. [2018-09-10 12:19:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14179 to 13858. [2018-09-10 12:19:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13858 states. [2018-09-10 12:19:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13858 states to 13858 states and 14506 transitions. [2018-09-10 12:19:14,309 INFO L78 Accepts]: Start accepts. Automaton has 13858 states and 14506 transitions. Word has length 1148 [2018-09-10 12:19:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:19:14,310 INFO L480 AbstractCegarLoop]: Abstraction has 13858 states and 14506 transitions. [2018-09-10 12:19:14,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:19:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13858 states and 14506 transitions. [2018-09-10 12:19:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1198 [2018-09-10 12:19:14,343 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:19:14,344 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:14,344 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:19:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash -989705038, now seen corresponding path program 1 times [2018-09-10 12:19:14,345 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:19:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:14,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:14,346 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:19:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:15,062 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 12:19:15,424 WARN L175 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 12:19:15,733 WARN L175 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 12:19:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 1480 proven. 407 refuted. 0 times theorem prover too weak. 1101 trivial. 0 not checked. [2018-09-10 12:19:17,583 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:19:17,583 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:19:17,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:17,591 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:19:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:17,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:19:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 1272 proven. 2 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-09-10 12:19:18,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:19:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 1272 proven. 2 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-09-10 12:19:19,749 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:19:19,750 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 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:19:19,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:19,766 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:19:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:20,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:19:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 1272 proven. 2 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-09-10 12:19:21,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:19:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 1272 proven. 2 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-09-10 12:19:22,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:19:22,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5, 5, 5] total 20 [2018-09-10 12:19:22,146 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:19:22,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-10 12:19:22,148 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-10 12:19:22,148 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-09-10 12:19:22,148 INFO L87 Difference]: Start difference. First operand 13858 states and 14506 transitions. Second operand 19 states. [2018-09-10 12:19:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:19:33,446 INFO L93 Difference]: Finished difference Result 29253 states and 30956 transitions. [2018-09-10 12:19:33,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-10 12:19:33,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1197 [2018-09-10 12:19:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:19:33,498 INFO L225 Difference]: With dead ends: 29253 [2018-09-10 12:19:33,499 INFO L226 Difference]: Without dead ends: 15451 [2018-09-10 12:19:33,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4870 GetRequests, 4813 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=654, Invalid=2426, Unknown=0, NotChecked=0, Total=3080 [2018-09-10 12:19:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15451 states. [2018-09-10 12:19:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15451 to 15426. [2018-09-10 12:19:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15426 states. [2018-09-10 12:19:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15426 states to 15426 states and 16224 transitions. [2018-09-10 12:19:33,830 INFO L78 Accepts]: Start accepts. Automaton has 15426 states and 16224 transitions. Word has length 1197 [2018-09-10 12:19:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:19:33,831 INFO L480 AbstractCegarLoop]: Abstraction has 15426 states and 16224 transitions. [2018-09-10 12:19:33,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-10 12:19:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 15426 states and 16224 transitions. [2018-09-10 12:19:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1536 [2018-09-10 12:19:33,890 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:19:33,892 INFO L376 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:33,892 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:19:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1980916941, now seen corresponding path program 1 times [2018-09-10 12:19:33,894 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:19:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:33,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:33,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:33,895 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:19:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 448 proven. 1099 refuted. 0 times theorem prover too weak. 2631 trivial. 0 not checked. [2018-09-10 12:19:36,029 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:19:36,029 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:19:36,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:36,037 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:19:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:36,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:19:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 1169 proven. 0 refuted. 0 times theorem prover too weak. 3009 trivial. 0 not checked. [2018-09-10 12:19:37,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:19:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 448 proven. 819 refuted. 0 times theorem prover too weak. 2911 trivial. 0 not checked. [2018-09-10 12:19:39,980 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:19:39,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 3] total 9 [2018-09-10 12:19:39,981 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:19:39,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:19:39,982 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:19:39,983 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:19:39,983 INFO L87 Difference]: Start difference. First operand 15426 states and 16224 transitions. Second operand 3 states. [2018-09-10 12:19:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:19:41,626 INFO L93 Difference]: Finished difference Result 41375 states and 43680 transitions. [2018-09-10 12:19:41,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:19:41,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1535 [2018-09-10 12:19:41,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:19:41,700 INFO L225 Difference]: With dead ends: 41375 [2018-09-10 12:19:41,700 INFO L226 Difference]: Without dead ends: 23336 [2018-09-10 12:19:41,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3077 GetRequests, 3070 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:19:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23336 states. [2018-09-10 12:19:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23336 to 22650. [2018-09-10 12:19:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22650 states. [2018-09-10 12:19:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22650 states to 22650 states and 23698 transitions. [2018-09-10 12:19:42,197 INFO L78 Accepts]: Start accepts. Automaton has 22650 states and 23698 transitions. Word has length 1535 [2018-09-10 12:19:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:19:42,198 INFO L480 AbstractCegarLoop]: Abstraction has 22650 states and 23698 transitions. [2018-09-10 12:19:42,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:19:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 22650 states and 23698 transitions. [2018-09-10 12:19:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1535 [2018-09-10 12:19:42,283 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:19:42,284 INFO L376 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:42,284 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:19:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1734519404, now seen corresponding path program 1 times [2018-09-10 12:19:42,286 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:19:42,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:42,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:42,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:42,287 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:19:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:43,865 WARN L175 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-10 12:19:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 871 proven. 398 refuted. 0 times theorem prover too weak. 2909 trivial. 0 not checked. [2018-09-10 12:19:45,703 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:19:45,703 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:19:45,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:45,711 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:19:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:46,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:19:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 1183 proven. 0 refuted. 0 times theorem prover too weak. 2995 trivial. 0 not checked. [2018-09-10 12:19:47,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:19:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 448 proven. 1099 refuted. 0 times theorem prover too weak. 2631 trivial. 0 not checked. [2018-09-10 12:19:51,055 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:19:51,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 6] total 17 [2018-09-10 12:19:51,057 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:19:51,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:19:51,059 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:19:51,059 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-09-10 12:19:51,059 INFO L87 Difference]: Start difference. First operand 22650 states and 23698 transitions. Second operand 6 states. [2018-09-10 12:19:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:19:55,112 INFO L93 Difference]: Finished difference Result 44651 states and 46377 transitions. [2018-09-10 12:19:55,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-10 12:19:55,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1534 [2018-09-10 12:19:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:19:55,162 INFO L225 Difference]: With dead ends: 44651 [2018-09-10 12:19:55,162 INFO L226 Difference]: Without dead ends: 23364 [2018-09-10 12:19:55,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3085 GetRequests, 3065 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-09-10 12:19:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23364 states. [2018-09-10 12:19:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23364 to 22880. [2018-09-10 12:19:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22880 states. [2018-09-10 12:19:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22880 states to 22880 states and 23592 transitions. [2018-09-10 12:19:55,502 INFO L78 Accepts]: Start accepts. Automaton has 22880 states and 23592 transitions. Word has length 1534 [2018-09-10 12:19:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:19:55,503 INFO L480 AbstractCegarLoop]: Abstraction has 22880 states and 23592 transitions. [2018-09-10 12:19:55,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:19:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 22880 states and 23592 transitions. [2018-09-10 12:19:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1783 [2018-09-10 12:19:55,560 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:19:55,561 INFO L376 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:19:55,561 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:19:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash 161726391, now seen corresponding path program 1 times [2018-09-10 12:19:55,562 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:19:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:55,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:19:55,563 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:19:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:19:57,088 WARN L175 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 12:19:57,910 WARN L175 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-10 12:19:58,255 WARN L175 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 12:19:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 1058 proven. 398 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2018-09-10 12:19:59,927 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:19:59,927 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:19:59,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:19:59,938 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:20:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:20:00,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:20:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 2613 proven. 6 refuted. 0 times theorem prover too weak. 2995 trivial. 0 not checked. [2018-09-10 12:20:02,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:20:02,626 WARN L175 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-09-10 12:20:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 540 proven. 2443 refuted. 0 times theorem prover too weak. 2631 trivial. 0 not checked. [2018-09-10 12:20:07,779 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:20:07,779 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 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:20:07,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:20:07,797 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:20:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:20:08,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:20:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 2372 proven. 6 refuted. 0 times theorem prover too weak. 3236 trivial. 0 not checked. [2018-09-10 12:20:11,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:20:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5614 backedges. 542 proven. 2441 refuted. 0 times theorem prover too weak. 2631 trivial. 0 not checked. [2018-09-10 12:20:21,153 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:20:21,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8, 7, 8] total 32 [2018-09-10 12:20:21,154 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:20:21,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-10 12:20:21,156 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-10 12:20:21,157 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2018-09-10 12:20:21,157 INFO L87 Difference]: Start difference. First operand 22880 states and 23592 transitions. Second operand 17 states. [2018-09-10 12:20:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:20:48,142 INFO L93 Difference]: Finished difference Result 51256 states and 52863 transitions. [2018-09-10 12:20:48,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-10 12:20:48,142 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1782 [2018-09-10 12:20:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:20:48,143 INFO L225 Difference]: With dead ends: 51256 [2018-09-10 12:20:48,143 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 12:20:48,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7198 GetRequests, 7134 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=621, Invalid=3285, Unknown=0, NotChecked=0, Total=3906 [2018-09-10 12:20:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 12:20:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 12:20:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 12:20:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 12:20:48,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1782 [2018-09-10 12:20:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:20:48,225 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 12:20:48,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-10 12:20:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 12:20:48,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 12:20:48,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 12:20:48,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:48,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:49,324 WARN L175 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 431 DAG size of output: 383 [2018-09-10 12:20:49,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:49,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:49,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:50,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,647 WARN L175 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 431 DAG size of output: 383 [2018-09-10 12:20:51,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:51,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:52,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:52,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:20:52,134 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 16 [2018-09-10 12:20:55,687 WARN L175 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 378 DAG size of output: 78 [2018-09-10 12:21:02,987 WARN L175 SmtUtils]: Spent 7.22 s on a formula simplification. DAG size of input: 413 DAG size of output: 123 [2018-09-10 12:21:06,423 WARN L175 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 378 DAG size of output: 78 [2018-09-10 12:21:09,075 WARN L175 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 296 DAG size of output: 83 [2018-09-10 12:21:12,558 WARN L175 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 395 DAG size of output: 88 [2018-09-10 12:21:12,562 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)|)) [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,563 INFO L426 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,564 INFO L426 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,564 INFO L426 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,564 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 12:21:12,564 INFO L426 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,564 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 12:21:12,564 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 12:21:12,565 INFO L422 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse8 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156)) (.cse21 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse22 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse23 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (let ((.cse17 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)|)) (.cse16 (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 4)) (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 8) .cse21 .cse22 .cse23)) (.cse11 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse20 (<= .cse8 0)) (.cse5 (= 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (let ((.cse6 (and .cse20 (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) .cse21 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10)) .cse5 .cse22 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 11) .cse23)) (.cse4 (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 79))) (.cse12 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse1 (not .cse11)) (.cse19 (and .cse20 .cse16)) (.cse0 (and .cse21 .cse22 .cse23)) (.cse7 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse26 (not (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse3 (not (= 11 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (.cse25 (not (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse18 (not (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|))) (.cse15 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse10 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse24 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| 4)) (.cse9 (and .cse17 .cse21 .cse22 .cse23)) (.cse14 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse2 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse13 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (and (or .cse0 .cse1 .cse2) (or (or .cse3 (not (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input 4)) .cse4 (not (= 3 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0))) (not .cse5) .cse6) (or .cse1 .cse7 (or (not (= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)) (not (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (not (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input 5)) (< 0 .cse8))) (or .cse6 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse9 (or .cse14 .cse11 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 6) .cse12 .cse13)) (or .cse15 .cse1 (and .cse16 .cse17) .cse18 (and .cse4 (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 134)) .cse19) (or .cse1 .cse0 .cse12) (or .cse14 .cse9 (and .cse20 .cse21 .cse5 .cse22 .cse23) .cse11 .cse7) (or .cse24 .cse25 .cse1 .cse9) (or (not .cse10) .cse26 .cse1 .cse9) (or .cse15 (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 156)) .cse10 .cse1 .cse19) (or .cse0 .cse10 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (or .cse24 .cse14 .cse9 .cse7) (or .cse26 .cse14 .cse9 .cse11) (or .cse10 .cse11 .cse2 .cse9 .cse13) (or .cse3 .cse25 (or (< 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 79)) (not (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output_~input 3))) .cse18) (or .cse24 .cse9 .cse15 .cse14 .cse13) (or .cse9 .cse15 .cse10 .cse11) (or .cse24 .cse9 .cse14 .cse2 .cse13))))) [2018-09-10 12:21:12,565 INFO L426 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,565 INFO L426 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2018-09-10 12:21:12,565 INFO L426 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,565 INFO L426 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,565 INFO L426 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,565 INFO L426 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,565 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,566 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,566 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,566 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 12:21:12,566 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 12:21:12,566 INFO L426 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,566 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 12:21:12,566 INFO L426 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,566 INFO L426 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,567 INFO L426 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,568 INFO L426 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,569 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,570 INFO L426 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,571 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,572 INFO L426 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 12:21:12,573 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,574 INFO L426 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,575 INFO L426 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,576 INFO L426 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,577 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,577 INFO L426 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,577 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,577 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 12:21:12,577 INFO L426 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,577 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 12:21:12,577 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 12:21:12,577 INFO L426 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,577 INFO L426 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,578 INFO L426 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,578 INFO L426 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,578 INFO L426 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,578 INFO L426 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,578 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,578 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,578 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,578 INFO L426 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,579 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,580 INFO L426 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,581 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,582 INFO L426 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,583 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,584 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,584 INFO L426 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,584 INFO L426 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,584 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 12:21:12,585 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 12:21:12,585 INFO L426 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,585 INFO L426 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,585 INFO L426 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,585 INFO L426 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,585 INFO L426 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,585 INFO L426 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,585 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-09-10 12:21:12,585 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,586 INFO L426 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,586 INFO L426 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,586 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,586 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,586 INFO L426 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,586 INFO L426 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,586 INFO L426 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,586 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 12:21:12,586 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 12:21:12,587 INFO L426 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,587 INFO L426 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,587 INFO L426 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,587 INFO L426 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,587 INFO L426 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,587 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,587 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,587 INFO L426 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,588 INFO L426 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,588 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 12:21:12,588 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 12:21:12,588 INFO L426 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,588 INFO L426 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,588 INFO L426 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,588 INFO L426 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,588 INFO L426 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,589 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,589 INFO L426 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,589 INFO L426 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,589 INFO L426 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,589 INFO L426 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,589 INFO L426 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,589 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,589 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,590 INFO L426 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,590 INFO L426 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,590 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 12:21:12,590 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 12:21:12,590 INFO L426 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,590 INFO L426 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,590 INFO L426 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,590 INFO L426 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,590 INFO L426 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,591 INFO L426 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,591 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,591 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,591 INFO L426 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-09-10 12:21:12,591 INFO L426 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,591 INFO L426 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,591 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,591 INFO L426 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,591 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 12:21:12,592 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 12:21:12,592 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 12:21:12,592 INFO L426 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,592 INFO L426 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,592 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,592 INFO L426 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,592 INFO L426 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,592 INFO L426 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,592 INFO L426 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 12:21:12,593 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,594 INFO L426 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,595 INFO L426 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,596 INFO L426 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,596 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,596 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,596 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,596 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2018-09-10 12:21:12,596 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 12:21:12,596 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 12:21:12,596 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 12:21:12,596 INFO L426 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,597 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse11 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse2 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse12 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse13 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (let ((.cse4 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse5 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| 4)) (.cse8 (and .cse12 .cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 8))) (.cse7 (not .cse2)) (.cse14 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse6 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse1 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse0 (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)|) .cse11 .cse12 .cse13)) (.cse9 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse10 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse3 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse0) (or .cse7 .cse8 .cse3) (or .cse6 (and (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 79)) (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 134)) .cse0 (not (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|))) (or .cse0 (or .cse9 .cse2 .cse3 .cse4)) (or (not .cse1) (not (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) .cse0 .cse7) (or .cse5 (not .cse10) .cse7 .cse0) (or (and .cse11 .cse12 .cse13) .cse1 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (or .cse6 .cse9 .cse2 .cse0 .cse4) (or .cse5 .cse9 .cse0 .cse14 .cse4) (or .cse1 .cse2 .cse14 .cse0 .cse4) (or .cse5 .cse7 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) .cse0) (or .cse6 (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 156)) .cse7 (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156) 0) .cse11 .cse12 .cse13)) (or .cse8 .cse7 .cse14) (or .cse0 .cse6 .cse1 .cse2) (or .cse0 .cse9 .cse2 .cse10 .cse3)))) [2018-09-10 12:21:12,597 INFO L426 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,597 INFO L426 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2018-09-10 12:21:12,597 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:21:12,597 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_c__a15~0 4)) (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) (= 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (= 0 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 87))) [2018-09-10 12:21:12,597 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 12:21:12,597 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:21:12,598 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)|) (= 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (not (= 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (not (= 11 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (not (= 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 87))) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) [2018-09-10 12:21:12,598 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2018-09-10 12:21:12,598 INFO L422 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 8))) (let ((.cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10))) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7))) (.cse4 (not .cse1)) (.cse5 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (let ((.cse0 (and .cse5 (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) .cse1)) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12))) (.cse9 (and .cse6 .cse2 .cse4)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 9)) (.cse8 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 4)))) (or (not (= 11 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156) 0) .cse0) (and (or (< 134 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0) (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 79) 0)) (= 3 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) .cse0) (and (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) .cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 5)) (and .cse2 .cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 8) .cse4 (not .cse5)) (and (<= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) .cse5 .cse1) (and .cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 6)) (and .cse6 .cse3 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and .cse7 (and .cse8 .cse9)) (and .cse7 .cse1) (and .cse9 .cse5 .cse3) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (and .cse9 .cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (not (= 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (and .cse8 .cse5 .cse4) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7) (and .cse8 .cse6)) (not (= 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 87))))))) [2018-09-10 12:21:12,598 INFO L426 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2018-09-10 12:21:12,598 INFO L426 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2018-09-10 12:21:12,598 INFO L426 ceAbstractionStarter]: For program point L1773-1(lines 1773 1782) no Hoare annotation was computed. [2018-09-10 12:21:12,599 INFO L422 ceAbstractionStarter]: At program point L1773-3(lines 1773 1782) the Hoare annotation is: (let ((.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 8))) (let ((.cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 10))) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7))) (.cse4 (not .cse1)) (.cse5 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (let ((.cse0 (and .cse5 (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|) .cse1)) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 12))) (.cse9 (and .cse6 .cse2 .cse4)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 9)) (.cse8 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 4)))) (or (not (= 11 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156) 0) .cse0) (and (or (< 134 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0) (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 79) 0)) (= 3 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) .cse0) (and (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0) .cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 5)) (and .cse2 .cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 8) .cse4 (not .cse5)) (and (<= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0) .cse5 .cse1) (and .cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 6)) (and .cse6 .cse3 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and .cse7 (and .cse8 .cse9)) (and .cse7 .cse1) (and .cse9 .cse5 .cse3) (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|) (and .cse9 .cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (not (= 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (and .cse8 .cse5 .cse4) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 7) (and .cse8 .cse6)) (not (= 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 87))))))) [2018-09-10 12:21:12,599 INFO L426 ceAbstractionStarter]: For program point L1773-4(lines 1767 1783) no Hoare annotation was computed. [2018-09-10 12:21:12,599 INFO L426 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,599 INFO L426 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,599 INFO L426 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,599 INFO L426 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,599 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2018-09-10 12:21:12,600 INFO L426 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,600 INFO L426 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,600 INFO L426 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,600 INFO L426 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,600 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse2 (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (let ((.cse18 (= 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse6 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse1 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse7 (not .cse2)) (.cse12 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)) (.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) (.cse14 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (let ((.cse10 (and .cse12 .cse13 .cse14)) (.cse8 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) (.cse4 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse5 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)| 4)) (.cse16 (< 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse15 (or .cse6 .cse1 .cse7)) (.cse17 (not .cse18)) (.cse9 (and .cse13 .cse14 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0 8))) (.cse11 (= 12 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|)) (.cse3 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse0 (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)|) .cse12 .cse13 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse0) (or .cse7 .cse8 .cse9) (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)| 6)) .cse7 .cse10) (or .cse0 (or .cse11 .cse2 .cse3 .cse4)) (or (not .cse1) (not (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) .cse0 .cse7) (or (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 156)) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0 156) 0) .cse12 .cse13 .cse14) .cse15) (or .cse7 .cse16 .cse10) (or .cse5 .cse17 .cse7 .cse0) (or .cse10 .cse1 (not (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16~0)|))) (or .cse6 .cse11 .cse2 .cse0 .cse4) (or .cse5 .cse11 .cse0 .cse8 .cse4) (or .cse1 .cse2 .cse8 .cse0 .cse4) (or .cse5 .cse7 .cse16 .cse0) (or (and (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 79)) (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18~0)| 134)) .cse0 (not (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15~0)|)) .cse15) (or .cse17 .cse7 .cse9) (or .cse0 .cse11 .cse2 .cse18 .cse3) (or .cse6 .cse1 .cse2 .cse0))))) [2018-09-10 12:21:12,600 INFO L426 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,601 INFO L426 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,601 INFO L426 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,601 INFO L426 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,601 INFO L426 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,601 INFO L426 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,601 INFO L426 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,601 INFO L426 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,601 INFO L426 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,601 INFO L426 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,602 INFO L426 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,603 INFO L426 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,604 INFO L426 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,604 INFO L426 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,604 INFO L426 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,604 INFO L426 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,604 INFO L426 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,604 INFO L426 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,604 INFO L426 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2018-09-10 12:21:12,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 12:21:12 BoogieIcfgContainer [2018-09-10 12:21:12,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 12:21:12,639 INFO L168 Benchmark]: Toolchain (without parser) took 225111.09 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-10 12:21:12,640 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 12:21:12,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1262.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-09-10 12:21:12,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 202.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:21:12,642 INFO L168 Benchmark]: Boogie Preprocessor took 508.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 815.8 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -964.2 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:21:12,645 INFO L168 Benchmark]: RCFGBuilder took 7831.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 284.3 MB). Peak memory consumption was 284.3 MB. Max. memory is 7.1 GB. [2018-09-10 12:21:12,646 INFO L168 Benchmark]: TraceAbstraction took 215300.75 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -620.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-10 12:21:12,655 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1262.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 202.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 508.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 815.8 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -964.2 MB). Peak memory consumption was 61.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7831.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 284.3 MB). Peak memory consumption was 284.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 215300.75 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -620.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 1773]: Loop Invariant Derived loop invariant: (((((((((((((((!(11 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 156 <= 0 && (8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) || (((134 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18 + 79 <= 0) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15) && (8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) || ((\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 5)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) && !(8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12))) || ((4 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 && 8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 6)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12)) && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 9 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8))) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 9 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) && 8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 12))) || 4 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 7)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16))) || !(5 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12))) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && 8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 8))) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 <= 7 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a15 == 4) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a16 == 10))) || !(0 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a18) + 87) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. SAFE Result, 215.1s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 115.9s AutomataDifference, 0.0s DeadEndRemovalTime, 24.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2861 SDtfs, 34993 SDslu, 3457 SDs, 0 SdLazy, 72341 SolverSat, 10336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 90.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30265 GetRequests, 29943 SyntacticMatches, 37 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2437 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22880occurred in iteration=15, 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: 3.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 2830 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 1834 PreInvPairs, 2808 NumberOfFragments, 1970 HoareAnnotationTreeSize, 1834 FomulaSimplifications, 236034 FormulaSimplificationTreeSizeReduction, 3.7s HoareSimplificationTime, 9 FomulaSimplificationsInter, 448186 FormulaSimplificationTreeSizeReductionInter, 20.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 52.9s InterpolantComputationTime, 26154 NumberOfCodeBlocks, 26154 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 41049 ConstructedInterpolants, 0 QuantifiedInterpolants, 182630810 SizeOfPredicates, 24 NumberOfNonLiveVariables, 20079 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 48 InterpolantComputations, 12 PerfectInterpolantSequences, 81498/91605 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/Problem16_label13_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_12-21-12-688.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem16_label13_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_12-21-12-688.csv Received shutdown request...