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/Problem03_label08_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:23:44,814 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:23:44,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:23:44,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:23:44,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:23:44,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:23:44,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:23:44,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:23:44,836 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:23:44,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:23:44,837 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:23:44,838 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:23:44,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:23:44,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:23:44,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:23:44,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:23:44,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:23:44,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:23:44,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:23:44,849 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:23:44,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:23:44,851 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:23:44,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:23:44,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:23:44,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:23:44,856 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:23:44,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:23:44,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:23:44,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:23:44,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:23:44,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:23:44,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:23:44,861 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:23:44,862 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:23:44,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:23:44,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:23:44,864 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:23:44,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:23:44,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:23:44,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:23:44,896 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:23:44,897 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:23:44,898 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:23:44,898 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:23:44,898 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:23:44,898 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:23:44,898 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:23:44,898 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:23:44,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:23:44,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:23:44,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:23:44,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:23:44,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:23:44,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:23:44,901 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:23:44,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:23:44,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:23:44,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:23:44,902 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:23:44,902 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:23:44,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:23:44,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:23:44,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:23:44,903 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:23:44,903 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:23:44,903 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:23:44,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:23:44,903 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:23:44,904 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:23:44,904 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:23:44,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:23:44,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:23:44,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:23:44,994 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:23:44,995 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:23:44,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08_true-unreach-call.c [2018-09-10 10:23:45,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56afe6ba3/eb0062a47b4d4293914de22905e98511/FLAGb3b6217f7 [2018-09-10 10:23:45,732 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:23:45,733 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label08_true-unreach-call.c [2018-09-10 10:23:45,770 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56afe6ba3/eb0062a47b4d4293914de22905e98511/FLAGb3b6217f7 [2018-09-10 10:23:45,791 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56afe6ba3/eb0062a47b4d4293914de22905e98511 [2018-09-10 10:23:45,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:23:45,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:23:45,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:23:45,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:23:45,821 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:23:45,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:23:45" (1/1) ... [2018-09-10 10:23:45,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39726d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:45, skipping insertion in model container [2018-09-10 10:23:45,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:23:45" (1/1) ... [2018-09-10 10:23:46,104 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:23:46,577 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:23:46,598 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:23:46,898 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:23:47,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47 WrapperNode [2018-09-10 10:23:47,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:23:47,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:23:47,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:23:47,017 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:23:47,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:23:47,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:23:47,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:23:47,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:23:47,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:23:47,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:23:47,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:23:47,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:23:47,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:23:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:23:47,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:23:47,656 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 10:23:47,656 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 10:23:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:23:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:23:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:23:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:23:52,703 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:23:52,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:52 BoogieIcfgContainer [2018-09-10 10:23:52,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:23:52,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:23:52,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:23:52,711 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:23:52,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:23:45" (1/3) ... [2018-09-10 10:23:52,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a7c579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:52, skipping insertion in model container [2018-09-10 10:23:52,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47" (2/3) ... [2018-09-10 10:23:52,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a7c579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:52, skipping insertion in model container [2018-09-10 10:23:52,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:52" (3/3) ... [2018-09-10 10:23:52,717 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label08_true-unreach-call.c [2018-09-10 10:23:52,727 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:23:52,738 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:23:52,801 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:23:52,802 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:23:52,802 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:23:52,802 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:23:52,802 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:23:52,802 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:23:52,803 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:23:52,803 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:23:52,803 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:23:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-10 10:23:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-10 10:23:52,851 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:52,853 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:52,854 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 10:23:52,860 INFO L82 PathProgramCache]: Analyzing trace with hash -555774503, now seen corresponding path program 1 times [2018-09-10 10:23:52,864 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:52,923 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:53,799 WARN L175 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:23:54,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:54,013 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:54,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:54,013 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:54,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:54,040 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:54,041 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:54,044 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2018-09-10 10:23:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:56,559 INFO L93 Difference]: Finished difference Result 844 states and 1489 transitions. [2018-09-10 10:23:56,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:56,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-09-10 10:23:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:56,587 INFO L225 Difference]: With dead ends: 844 [2018-09-10 10:23:56,587 INFO L226 Difference]: Without dead ends: 530 [2018-09-10 10:23:56,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-09-10 10:23:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 525. [2018-09-10 10:23:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-09-10 10:23:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 865 transitions. [2018-09-10 10:23:56,722 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 865 transitions. Word has length 164 [2018-09-10 10:23:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:56,724 INFO L480 AbstractCegarLoop]: Abstraction has 525 states and 865 transitions. [2018-09-10 10:23:56,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 865 transitions. [2018-09-10 10:23:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-10 10:23:56,735 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:56,736 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:56,736 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 10:23:56,737 INFO L82 PathProgramCache]: Analyzing trace with hash 348546397, now seen corresponding path program 1 times [2018-09-10 10:23:56,737 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:56,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:56,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:56,739 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:57,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:57,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:57,168 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:57,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:57,170 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:57,170 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:57,171 INFO L87 Difference]: Start difference. First operand 525 states and 865 transitions. Second operand 3 states. [2018-09-10 10:23:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:59,397 INFO L93 Difference]: Finished difference Result 1481 states and 2515 transitions. [2018-09-10 10:23:59,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:59,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2018-09-10 10:23:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:59,408 INFO L225 Difference]: With dead ends: 1481 [2018-09-10 10:23:59,409 INFO L226 Difference]: Without dead ends: 962 [2018-09-10 10:23:59,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-09-10 10:23:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 947. [2018-09-10 10:23:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-09-10 10:23:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1536 transitions. [2018-09-10 10:23:59,469 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1536 transitions. Word has length 177 [2018-09-10 10:23:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:59,470 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 1536 transitions. [2018-09-10 10:23:59,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1536 transitions. [2018-09-10 10:23:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-10 10:23:59,475 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:59,475 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:59,476 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 10:23:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash -384220112, now seen corresponding path program 1 times [2018-09-10 10:23:59,476 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:59,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:59,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:59,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:59,479 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:59,873 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:59,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-10 10:23:59,874 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:59,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:23:59,875 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:23:59,875 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:59,876 INFO L87 Difference]: Start difference. First operand 947 states and 1536 transitions. Second operand 7 states. [2018-09-10 10:24:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:05,548 INFO L93 Difference]: Finished difference Result 2931 states and 5168 transitions. [2018-09-10 10:24:05,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 10:24:05,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2018-09-10 10:24:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:05,572 INFO L225 Difference]: With dead ends: 2931 [2018-09-10 10:24:05,572 INFO L226 Difference]: Without dead ends: 1990 [2018-09-10 10:24:05,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:24:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2018-09-10 10:24:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1886. [2018-09-10 10:24:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-09-10 10:24:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3092 transitions. [2018-09-10 10:24:05,672 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3092 transitions. Word has length 182 [2018-09-10 10:24:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:05,672 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 3092 transitions. [2018-09-10 10:24:05,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:24:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3092 transitions. [2018-09-10 10:24:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-10 10:24:05,679 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:05,680 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:05,680 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 10:24:05,680 INFO L82 PathProgramCache]: Analyzing trace with hash -713899340, now seen corresponding path program 1 times [2018-09-10 10:24:05,680 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:05,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:05,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:05,682 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:05,948 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:05,948 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:05,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:05,959 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:06,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:06,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:06,837 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:24:06,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:24:06,837 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:06,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:24:06,839 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:24:06,839 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:24:06,839 INFO L87 Difference]: Start difference. First operand 1886 states and 3092 transitions. Second operand 3 states. [2018-09-10 10:24:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:09,276 INFO L93 Difference]: Finished difference Result 5528 states and 9350 transitions. [2018-09-10 10:24:09,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:24:09,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-09-10 10:24:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:09,299 INFO L225 Difference]: With dead ends: 5528 [2018-09-10 10:24:09,299 INFO L226 Difference]: Without dead ends: 3648 [2018-09-10 10:24:09,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:24:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2018-09-10 10:24:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3625. [2018-09-10 10:24:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3625 states. [2018-09-10 10:24:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5919 transitions. [2018-09-10 10:24:09,419 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5919 transitions. Word has length 195 [2018-09-10 10:24:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:09,420 INFO L480 AbstractCegarLoop]: Abstraction has 3625 states and 5919 transitions. [2018-09-10 10:24:09,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:24:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5919 transitions. [2018-09-10 10:24:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-10 10:24:09,434 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:09,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:09,434 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 10:24:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash -694494722, now seen corresponding path program 1 times [2018-09-10 10:24:09,435 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:09,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:09,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:09,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:09,436 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:09,718 WARN L175 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:24:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:09,810 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:24:09,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:24:09,810 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:09,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:24:09,811 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:24:09,811 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:24:09,812 INFO L87 Difference]: Start difference. First operand 3625 states and 5919 transitions. Second operand 6 states. [2018-09-10 10:24:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:12,355 INFO L93 Difference]: Finished difference Result 11564 states and 19973 transitions. [2018-09-10 10:24:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:24:12,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2018-09-10 10:24:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:12,419 INFO L225 Difference]: With dead ends: 11564 [2018-09-10 10:24:12,419 INFO L226 Difference]: Without dead ends: 7945 [2018-09-10 10:24:12,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:24:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7945 states. [2018-09-10 10:24:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7945 to 7759. [2018-09-10 10:24:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7759 states. [2018-09-10 10:24:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7759 states to 7759 states and 11960 transitions. [2018-09-10 10:24:12,726 INFO L78 Accepts]: Start accepts. Automaton has 7759 states and 11960 transitions. Word has length 208 [2018-09-10 10:24:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:12,727 INFO L480 AbstractCegarLoop]: Abstraction has 7759 states and 11960 transitions. [2018-09-10 10:24:12,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:24:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 7759 states and 11960 transitions. [2018-09-10 10:24:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-10 10:24:12,754 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:12,754 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:12,755 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 10:24:12,755 INFO L82 PathProgramCache]: Analyzing trace with hash 163543938, now seen corresponding path program 1 times [2018-09-10 10:24:12,755 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:12,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:12,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:12,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:12,756 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:13,308 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:13,308 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 10:24:13,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:13,321 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:13,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-10 10:24:13,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:24:13,997 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:24:13,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-09-10 10:24:13,997 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:13,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:24:13,998 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:24:13,998 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:24:13,998 INFO L87 Difference]: Start difference. First operand 7759 states and 11960 transitions. Second operand 5 states. [2018-09-10 10:24:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:16,614 INFO L93 Difference]: Finished difference Result 16097 states and 25105 transitions. [2018-09-10 10:24:16,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:24:16,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2018-09-10 10:24:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:16,669 INFO L225 Difference]: With dead ends: 16097 [2018-09-10 10:24:16,669 INFO L226 Difference]: Without dead ends: 8344 [2018-09-10 10:24:16,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:24:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8344 states. [2018-09-10 10:24:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8344 to 8251. [2018-09-10 10:24:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8251 states. [2018-09-10 10:24:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8251 states to 8251 states and 12144 transitions. [2018-09-10 10:24:16,925 INFO L78 Accepts]: Start accepts. Automaton has 8251 states and 12144 transitions. Word has length 221 [2018-09-10 10:24:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:16,925 INFO L480 AbstractCegarLoop]: Abstraction has 8251 states and 12144 transitions. [2018-09-10 10:24:16,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:24:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 8251 states and 12144 transitions. [2018-09-10 10:24:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-10 10:24:16,956 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:16,956 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:16,957 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 10:24:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash -614011123, now seen corresponding path program 1 times [2018-09-10 10:24:16,957 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:16,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:16,965 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:17,512 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:17,512 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:17,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:17,529 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:17,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:17,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:18,404 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:18,404 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:24:18,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:18,427 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:18,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 59 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:19,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:19,663 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2018-09-10 10:24:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:19,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:24:19,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 7, 5] total 13 [2018-09-10 10:24:19,697 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:24:19,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:24:19,698 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:24:19,698 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:24:19,699 INFO L87 Difference]: Start difference. First operand 8251 states and 12144 transitions. Second operand 6 states. [2018-09-10 10:24:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:20,987 INFO L93 Difference]: Finished difference Result 16396 states and 24296 transitions. [2018-09-10 10:24:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:24:20,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-09-10 10:24:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:21,016 INFO L225 Difference]: With dead ends: 16396 [2018-09-10 10:24:21,016 INFO L226 Difference]: Without dead ends: 8151 [2018-09-10 10:24:21,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 911 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:24:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8151 states. [2018-09-10 10:24:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8151 to 8151. [2018-09-10 10:24:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8151 states. [2018-09-10 10:24:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8151 states to 8151 states and 11678 transitions. [2018-09-10 10:24:21,231 INFO L78 Accepts]: Start accepts. Automaton has 8151 states and 11678 transitions. Word has length 230 [2018-09-10 10:24:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:21,231 INFO L480 AbstractCegarLoop]: Abstraction has 8151 states and 11678 transitions. [2018-09-10 10:24:21,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:24:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 8151 states and 11678 transitions. [2018-09-10 10:24:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-10 10:24:21,258 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:21,258 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:21,259 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 10:24:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash -941313076, now seen corresponding path program 1 times [2018-09-10 10:24:21,259 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:21,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:21,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:21,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:21,260 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:21,589 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:21,589 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:21,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:21,598 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:21,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 71 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-10 10:24:22,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-10 10:24:23,306 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:24:23,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-09-10 10:24:23,307 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:23,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:24:23,307 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:24:23,308 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:24:23,308 INFO L87 Difference]: Start difference. First operand 8151 states and 11678 transitions. Second operand 5 states. [2018-09-10 10:24:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:24,120 INFO L93 Difference]: Finished difference Result 23971 states and 34533 transitions. [2018-09-10 10:24:24,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:24:24,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2018-09-10 10:24:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:24,178 INFO L225 Difference]: With dead ends: 23971 [2018-09-10 10:24:24,179 INFO L226 Difference]: Without dead ends: 15826 [2018-09-10 10:24:24,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 476 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:24:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15826 states. [2018-09-10 10:24:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15826 to 15820. [2018-09-10 10:24:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15820 states. [2018-09-10 10:24:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15820 states to 15820 states and 22784 transitions. [2018-09-10 10:24:24,528 INFO L78 Accepts]: Start accepts. Automaton has 15820 states and 22784 transitions. Word has length 242 [2018-09-10 10:24:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:24,528 INFO L480 AbstractCegarLoop]: Abstraction has 15820 states and 22784 transitions. [2018-09-10 10:24:24,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:24:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 15820 states and 22784 transitions. [2018-09-10 10:24:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-10 10:24:24,567 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:24,567 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:24:24,567 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 10:24:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1176887553, now seen corresponding path program 1 times [2018-09-10 10:24:24,568 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:24,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:24,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:24,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:24,569 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:25,001 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:24:25,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 10:24:25,001 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:25,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:24:25,002 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:24:25,002 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:24:25,003 INFO L87 Difference]: Start difference. First operand 15820 states and 22784 transitions. Second operand 4 states. [2018-09-10 10:24:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:28,415 INFO L93 Difference]: Finished difference Result 53219 states and 79985 transitions. [2018-09-10 10:24:28,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:24:28,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-09-10 10:24:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:28,567 INFO L225 Difference]: With dead ends: 53219 [2018-09-10 10:24:28,567 INFO L226 Difference]: Without dead ends: 37405 [2018-09-10 10:24:28,616 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 10:24:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37405 states. [2018-09-10 10:24:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37405 to 37222. [2018-09-10 10:24:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37222 states. [2018-09-10 10:24:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37222 states to 37222 states and 54847 transitions. [2018-09-10 10:24:29,380 INFO L78 Accepts]: Start accepts. Automaton has 37222 states and 54847 transitions. Word has length 265 [2018-09-10 10:24:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:29,381 INFO L480 AbstractCegarLoop]: Abstraction has 37222 states and 54847 transitions. [2018-09-10 10:24:29,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:24:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 37222 states and 54847 transitions. [2018-09-10 10:24:29,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-10 10:24:29,443 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:29,443 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:24:29,443 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 10:24:29,444 INFO L82 PathProgramCache]: Analyzing trace with hash -899002861, now seen corresponding path program 1 times [2018-09-10 10:24:29,444 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:29,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:29,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:29,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:29,445 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:29,841 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:24:29,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:24:29,842 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:29,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:24:29,842 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:24:29,842 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:24:29,843 INFO L87 Difference]: Start difference. First operand 37222 states and 54847 transitions. Second operand 3 states. [2018-09-10 10:24:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:31,810 INFO L93 Difference]: Finished difference Result 74015 states and 109243 transitions. [2018-09-10 10:24:31,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:24:31,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2018-09-10 10:24:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:31,811 INFO L225 Difference]: With dead ends: 74015 [2018-09-10 10:24:31,811 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:24:31,898 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:24:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:24:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:24:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:24:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:24:31,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2018-09-10 10:24:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:31,900 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:24:31,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:24:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:24:31,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:24:31,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:24:32,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,672 WARN L175 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 127 [2018-09-10 10:24:32,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:32,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:33,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:33,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:33,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:33,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:24:33,081 WARN L175 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 127 [2018-09-10 10:24:33,280 WARN L175 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-10 10:24:33,431 WARN L175 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-09-10 10:24:39,108 WARN L175 SmtUtils]: Spent 5.63 s on a formula simplification. DAG size of input: 378 DAG size of output: 71 [2018-09-10 10:24:39,563 WARN L175 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 [2018-09-10 10:24:39,949 WARN L175 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 [2018-09-10 10:24:39,952 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:24:39,952 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|) (or (<= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)) [2018-09-10 10:24:39,952 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,953 INFO L426 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2018-09-10 10:24:39,954 INFO L426 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,955 INFO L426 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,956 INFO L426 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,956 INFO L426 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,956 INFO L426 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,956 INFO L426 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,956 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 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,956 INFO L426 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2018-09-10 10:24:39,956 INFO L426 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2018-09-10 10:24:39,956 INFO L426 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2018-09-10 10:24:39,957 INFO L426 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,957 INFO L426 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,957 INFO L426 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,957 INFO L426 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,957 INFO L426 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,957 INFO L426 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,957 INFO L426 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2018-09-10 10:24:39,957 INFO L426 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2018-09-10 10:24:39,957 INFO L426 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2018-09-10 10:24:39,958 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,958 INFO L426 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,958 INFO L426 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,958 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 1506) no Hoare annotation was computed. [2018-09-10 10:24:39,958 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2018-09-10 10:24:39,958 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,958 INFO L426 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2018-09-10 10:24:39,958 INFO L426 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,959 INFO L426 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,960 INFO L426 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2018-09-10 10:24:39,960 INFO L426 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2018-09-10 10:24:39,960 INFO L426 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2018-09-10 10:24:39,960 INFO L426 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2018-09-10 10:24:39,960 INFO L426 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2018-09-10 10:24:39,960 INFO L426 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,960 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,960 INFO L426 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2018-09-10 10:24:39,961 INFO L426 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2018-09-10 10:24:39,962 INFO L426 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,963 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,964 INFO L426 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2018-09-10 10:24:39,965 INFO L426 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,966 INFO L426 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,967 INFO L426 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,968 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 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,968 INFO L426 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2018-09-10 10:24:39,969 INFO L426 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2018-09-10 10:24:39,970 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,971 INFO L426 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2018-09-10 10:24:39,972 INFO L426 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2018-09-10 10:24:39,973 INFO L426 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,973 INFO L426 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2018-09-10 10:24:39,973 INFO L426 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2018-09-10 10:24:39,973 INFO L426 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2018-09-10 10:24:39,973 INFO L426 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,973 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,973 INFO L426 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,973 INFO L426 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,973 INFO L426 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,974 INFO L426 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2018-09-10 10:24:39,974 INFO L426 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2018-09-10 10:24:39,974 INFO L426 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,974 INFO L426 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,974 INFO L426 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,974 INFO L426 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2018-09-10 10:24:39,974 INFO L426 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2018-09-10 10:24:39,975 INFO L426 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,975 INFO L426 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2018-09-10 10:24:39,975 INFO L426 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,975 INFO L426 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,975 INFO L426 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,975 INFO L426 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,975 INFO L426 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,976 INFO L426 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,976 INFO L426 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,976 INFO L426 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,976 INFO L426 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,976 INFO L426 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,976 INFO L426 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2018-09-10 10:24:39,976 INFO L426 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2018-09-10 10:24:39,976 INFO L426 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2018-09-10 10:24:39,977 INFO L426 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,977 INFO L426 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2018-09-10 10:24:39,977 INFO L426 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2018-09-10 10:24:39,977 INFO L426 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,977 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,977 INFO L426 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,977 INFO L426 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,978 INFO L426 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,978 INFO L426 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,978 INFO L426 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,978 INFO L426 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,978 INFO L426 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,978 INFO L426 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2018-09-10 10:24:39,978 INFO L426 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2018-09-10 10:24:39,978 INFO L426 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2018-09-10 10:24:39,979 INFO L426 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,979 INFO L426 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,979 INFO L426 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,979 INFO L426 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,979 INFO L426 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2018-09-10 10:24:39,980 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 54 1650) the Hoare annotation is: (let ((.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0 2)) (.cse3 (not (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)|))) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 1))) (.cse11 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 0)) (.cse2 (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|)) (.cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)) (.cse6 (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0))) (.cse7 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|))) (.cse15 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|))) (.cse9 (= 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)|)) (.cse16 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|)) (.cse10 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)) (.cse17 (or (<= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 1))) (.cse13 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)) (.cse14 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)) (.cse0 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|)) (.cse1 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|))) (.cse18 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0)) (.cse8 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse2) (or .cse1 .cse6 .cse7 .cse8 .cse9) (or .cse1 (and .cse10 .cse11 .cse12 .cse13 .cse14) .cse7 .cse15 .cse16) (or .cse6 .cse0 .cse1 .cse9) (or .cse0 .cse1 .cse4 .cse15 .cse3) (or .cse0 .cse1 .cse4 .cse8 .cse3) (or (and .cse10 .cse17 .cse12 .cse13 .cse14 .cse4) .cse1 .cse7 .cse3) (or (and .cse10 .cse17 .cse12 .cse13 .cse5 .cse14) .cse1 .cse2 .cse7) (or .cse1 .cse7 .cse8 .cse11 .cse16) (or .cse1 .cse2 .cse7 .cse6 .cse9) (or .cse1 .cse7 .cse8 (and .cse10 .cse12 .cse13 .cse14 .cse18)) (or .cse1 .cse6 .cse7 .cse15 .cse9 .cse16) (or .cse0 .cse1 (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|) .cse10 .cse17 .cse13 .cse14)) (or .cse0 .cse1 .cse18 .cse8))) [2018-09-10 10:24:39,980 INFO L426 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,980 INFO L426 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2018-09-10 10:24:39,980 INFO L426 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2018-09-10 10:24:39,980 INFO L426 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,980 INFO L426 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2018-09-10 10:24:39,981 INFO L426 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2018-09-10 10:24:39,981 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:24:39,981 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0 1)) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 1))) [2018-09-10 10:24:39,981 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:24:39,981 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:24:39,981 INFO L426 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-09-10 10:24:39,981 INFO L426 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2018-09-10 10:24:39,982 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 1652 1669) the Hoare annotation is: (or (and (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|)) (= 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)|) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|)) [2018-09-10 10:24:39,982 INFO L426 ceAbstractionStarter]: For program point L1658-1(lines 1658 1668) no Hoare annotation was computed. [2018-09-10 10:24:39,982 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 1652 1669) no Hoare annotation was computed. [2018-09-10 10:24:39,982 INFO L422 ceAbstractionStarter]: At program point L1658-3(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)) (.cse0 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0))) (or (and .cse0 .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 1))) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|)) (and .cse0 .cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0 2)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (and .cse0 .cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0)) (and .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 0) .cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0 0) .cse0) (= 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)|) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) [2018-09-10 10:24:39,982 INFO L426 ceAbstractionStarter]: For program point L1658-4(lines 1652 1669) no Hoare annotation was computed. [2018-09-10 10:24:39,983 INFO L422 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)) (.cse0 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0))) (or (and .cse0 .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 1))) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0)|)) (and .cse0 .cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0 2)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)|) (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5~0)|)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (and .cse0 .cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26~0)) (and .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 0) .cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6~0)|) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27~0 0) .cse0) (= 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)|) (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)|))) [2018-09-10 10:24:40,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:24:40 BoogieIcfgContainer [2018-09-10 10:24:40,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:24:40,006 INFO L168 Benchmark]: Toolchain (without parser) took 54199.38 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -254.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-10 10:24:40,007 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:24:40,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1205.22 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:24:40,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 181.27 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:24:40,009 INFO L168 Benchmark]: Boogie Preprocessor took 374.49 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 811.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -955.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:24:40,010 INFO L168 Benchmark]: RCFGBuilder took 5131.53 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 282.9 MB). Peak memory consumption was 282.9 MB. Max. memory is 7.1 GB. [2018-09-10 10:24:40,011 INFO L168 Benchmark]: TraceAbstraction took 47298.86 ms. Allocated memory was 2.4 GB in the beginning and 3.0 GB in the end (delta: 688.4 MB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 312.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-10 10:24:40,015 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.19 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 1205.22 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 181.27 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 374.49 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 811.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -955.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5131.53 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 282.9 MB). Peak memory consumption was 282.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47298.86 ms. Allocated memory was 2.4 GB in the beginning and 3.0 GB in the end (delta: 688.4 MB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 312.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1506]: 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: 1658]: Loop Invariant Derived loop invariant: ((((((((((((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12 == 1)) || !(1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27))) || ((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 2)) || 0 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23)) || !(1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5))) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1) == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6)) || ((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a26)) || (((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 0) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6)) || 1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a6)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a27 <= 0 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a5)) || 0 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || 1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. SAFE Result, 47.1s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 26.2s AutomataDifference, 0.0s DeadEndRemovalTime, 8.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 6428 SDslu, 1896 SDs, 0 SdLazy, 9333 SolverSat, 1841 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2302 GetRequests, 2229 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37222occurred in iteration=9, 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: 2.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 615 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 511 PreInvPairs, 825 NumberOfFragments, 602 HoareAnnotationTreeSize, 511 FomulaSimplifications, 30468 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12935 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 3286 NumberOfCodeBlocks, 3286 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4384 ConstructedInterpolants, 0 QuantifiedInterpolants, 2063013 SizeOfPredicates, 7 NumberOfNonLiveVariables, 5221 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 1210/1255 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/Problem03_label08_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-24-40-032.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label08_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-24-40-032.csv Received shutdown request...