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/Problem02_label41_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:22:54,834 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:22:54,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:22:54,854 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:22:54,855 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:22:54,856 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:22:54,857 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:22:54,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:22:54,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:22:54,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:22:54,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:22:54,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:22:54,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:22:54,867 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:22:54,870 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:22:54,871 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:22:54,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:22:54,874 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:22:54,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:22:54,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:22:54,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:22:54,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:22:54,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:22:54,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:22:54,883 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:22:54,884 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:22:54,885 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:22:54,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:22:54,886 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:22:54,887 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:22:54,888 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:22:54,889 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:22:54,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:22:54,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:22:54,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:22:54,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:22:54,891 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:22:54,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:22:54,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:22:54,915 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:22:54,916 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:22:54,916 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:22:54,917 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:22:54,917 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:22:54,917 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:22:54,917 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:22:54,917 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:22:54,918 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:22:54,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:22:54,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:22:54,919 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:22:54,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:22:54,920 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:22:54,920 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:22:54,920 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:22:54,920 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:22:54,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:22:54,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:22:54,921 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:22:54,921 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:22:54,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:22:54,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:22:54,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:22:54,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:22:54,924 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:22:54,924 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:22:54,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:22:54,924 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:22:54,924 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:22:54,925 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:22:54,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:22:55,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:22:55,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:22:55,006 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:22:55,006 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:22:55,007 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c [2018-09-10 10:22:55,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d995cb31/499eea23dbd343d8912d4869f6320945/FLAG66a8e2199 [2018-09-10 10:22:55,639 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:22:55,639 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c [2018-09-10 10:22:55,669 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d995cb31/499eea23dbd343d8912d4869f6320945/FLAG66a8e2199 [2018-09-10 10:22:55,687 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d995cb31/499eea23dbd343d8912d4869f6320945 [2018-09-10 10:22:55,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:22:55,701 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:22:55,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:22:55,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:22:55,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:22:55,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:22:55" (1/1) ... [2018-09-10 10:22:55,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c01a3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:55, skipping insertion in model container [2018-09-10 10:22:55,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:22:55" (1/1) ... [2018-09-10 10:22:55,987 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:22:56,296 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:22:56,319 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:22:56,398 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:22:56,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56 WrapperNode [2018-09-10 10:22:56,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:22:56,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:22:56,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:22:56,433 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:22:56,443 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:22:56" (1/1) ... [2018-09-10 10:22:56,464 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:22:56" (1/1) ... [2018-09-10 10:22:56,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:22:56,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:22:56,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:22:56,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:22:56,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56" (1/1) ... [2018-09-10 10:22:56,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56" (1/1) ... [2018-09-10 10:22:56,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56" (1/1) ... [2018-09-10 10:22:56,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56" (1/1) ... [2018-09-10 10:22:56,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56" (1/1) ... [2018-09-10 10:22:56,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56" (1/1) ... [2018-09-10 10:22:56,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56" (1/1) ... [2018-09-10 10:22:56,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:22:56,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:22:56,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:22:56,720 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:22:56,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56" (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:22:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:22:56,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 10:22:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:22:56,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:22:56,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:22:56,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:22:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:22:56,794 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:23:00,058 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:23:00,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:00 BoogieIcfgContainer [2018-09-10 10:23:00,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:23:00,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:23:00,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:23:00,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:23:00,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:22:55" (1/3) ... [2018-09-10 10:23:00,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aef2365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:00, skipping insertion in model container [2018-09-10 10:23:00,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:56" (2/3) ... [2018-09-10 10:23:00,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aef2365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:00, skipping insertion in model container [2018-09-10 10:23:00,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:00" (3/3) ... [2018-09-10 10:23:00,068 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label41_true-unreach-call_false-termination.c [2018-09-10 10:23:00,081 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:23:00,089 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:23:00,140 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:23:00,141 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:23:00,141 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:23:00,141 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:23:00,141 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:23:00,142 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:23:00,142 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:23:00,142 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:23:00,142 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:23:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-10 10:23:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-10 10:23:00,195 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:00,196 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] [2018-09-10 10:23:00,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1916529733, now seen corresponding path program 1 times [2018-09-10 10:23:00,208 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:00,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:00,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:00,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:00,255 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:00,912 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:00,914 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:00,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:00,915 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:00,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:00,940 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:00,941 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:00,944 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-10 10:23:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:02,860 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-09-10 10:23:02,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:02,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-09-10 10:23:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:02,881 INFO L225 Difference]: With dead ends: 621 [2018-09-10 10:23:02,881 INFO L226 Difference]: Without dead ends: 382 [2018-09-10 10:23:02,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-10 10:23:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-10 10:23:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-10 10:23:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-09-10 10:23:02,967 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 97 [2018-09-10 10:23:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:02,968 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-09-10 10:23:02,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-09-10 10:23:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-10 10:23:02,975 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:02,975 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:02,976 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash 923735002, now seen corresponding path program 1 times [2018-09-10 10:23:02,976 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:02,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:02,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:02,978 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:03,207 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:03,208 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:23:03,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:03,226 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:03,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:03,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:03,657 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:23:03,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:23:03,658 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:03,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:03,659 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:03,659 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:03,660 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 3 states. [2018-09-10 10:23:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:04,851 INFO L93 Difference]: Finished difference Result 1051 states and 1737 transitions. [2018-09-10 10:23:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:04,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-09-10 10:23:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:04,859 INFO L225 Difference]: With dead ends: 1051 [2018-09-10 10:23:04,859 INFO L226 Difference]: Without dead ends: 675 [2018-09-10 10:23:04,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-09-10 10:23:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 674. [2018-09-10 10:23:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-09-10 10:23:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1053 transitions. [2018-09-10 10:23:04,918 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1053 transitions. Word has length 106 [2018-09-10 10:23:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:04,919 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 1053 transitions. [2018-09-10 10:23:04,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1053 transitions. [2018-09-10 10:23:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-10 10:23:04,924 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:04,925 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:04,925 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash 97552038, now seen corresponding path program 1 times [2018-09-10 10:23:04,926 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:04,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:04,928 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:05,137 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:05,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:05,137 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:05,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:05,138 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:05,138 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:05,139 INFO L87 Difference]: Start difference. First operand 674 states and 1053 transitions. Second operand 3 states. [2018-09-10 10:23:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:07,351 INFO L93 Difference]: Finished difference Result 1930 states and 3123 transitions. [2018-09-10 10:23:07,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:07,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-09-10 10:23:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:07,367 INFO L225 Difference]: With dead ends: 1930 [2018-09-10 10:23:07,367 INFO L226 Difference]: Without dead ends: 1262 [2018-09-10 10:23:07,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:23:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-10 10:23:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1257. [2018-09-10 10:23:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2018-09-10 10:23:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1923 transitions. [2018-09-10 10:23:07,445 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1923 transitions. Word has length 112 [2018-09-10 10:23:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:07,446 INFO L480 AbstractCegarLoop]: Abstraction has 1257 states and 1923 transitions. [2018-09-10 10:23:07,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1923 transitions. [2018-09-10 10:23:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-10 10:23:07,451 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:07,451 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:07,452 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:07,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1423035543, now seen corresponding path program 1 times [2018-09-10 10:23:07,452 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:07,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:07,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:07,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:07,454 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:23:07,607 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:07,607 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:23:07,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:07,619 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:07,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:07,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:08,061 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:08,061 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:08,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:08,077 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:08,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:23:08,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:23:08,453 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-09-10 10:23:08,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5] total 13 [2018-09-10 10:23:08,453 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:08,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:08,454 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:08,456 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:23:08,456 INFO L87 Difference]: Start difference. First operand 1257 states and 1923 transitions. Second operand 5 states. [2018-09-10 10:23:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:10,126 INFO L93 Difference]: Finished difference Result 3737 states and 5985 transitions. [2018-09-10 10:23:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:23:10,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-09-10 10:23:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:10,153 INFO L225 Difference]: With dead ends: 3737 [2018-09-10 10:23:10,153 INFO L226 Difference]: Without dead ends: 2486 [2018-09-10 10:23:10,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 456 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:23:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2018-09-10 10:23:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2444. [2018-09-10 10:23:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2018-09-10 10:23:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3663 transitions. [2018-09-10 10:23:10,268 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3663 transitions. Word has length 117 [2018-09-10 10:23:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:10,269 INFO L480 AbstractCegarLoop]: Abstraction has 2444 states and 3663 transitions. [2018-09-10 10:23:10,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3663 transitions. [2018-09-10 10:23:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-10 10:23:10,275 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:10,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:10,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1935334917, now seen corresponding path program 1 times [2018-09-10 10:23:10,276 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:10,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:10,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:10,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:10,277 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:10,696 WARN L175 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-10 10:23:10,937 WARN L175 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 10:23:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:11,312 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:11,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:23:11,312 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:11,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:11,313 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:11,313 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:11,313 INFO L87 Difference]: Start difference. First operand 2444 states and 3663 transitions. Second operand 5 states. [2018-09-10 10:23:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:13,117 INFO L93 Difference]: Finished difference Result 5027 states and 7644 transitions. [2018-09-10 10:23:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:13,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-09-10 10:23:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:13,133 INFO L225 Difference]: With dead ends: 5027 [2018-09-10 10:23:13,133 INFO L226 Difference]: Without dead ends: 2441 [2018-09-10 10:23:13,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2018-09-10 10:23:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2441. [2018-09-10 10:23:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2018-09-10 10:23:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3588 transitions. [2018-09-10 10:23:13,244 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3588 transitions. Word has length 124 [2018-09-10 10:23:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:13,244 INFO L480 AbstractCegarLoop]: Abstraction has 2441 states and 3588 transitions. [2018-09-10 10:23:13,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3588 transitions. [2018-09-10 10:23:13,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-10 10:23:13,252 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:13,252 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:13,252 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:13,253 INFO L82 PathProgramCache]: Analyzing trace with hash -417801157, now seen corresponding path program 1 times [2018-09-10 10:23:13,253 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:13,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:13,254 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:13,593 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:13,593 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:13,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:13,605 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:13,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:23:13,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:14,146 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:14,146 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:14,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:14,172 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:14,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:23:14,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:14,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:14,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-10 10:23:14,646 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:14,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:23:14,647 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:23:14,647 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:23:14,647 INFO L87 Difference]: Start difference. First operand 2441 states and 3588 transitions. Second operand 9 states. [2018-09-10 10:23:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:19,648 INFO L93 Difference]: Finished difference Result 7268 states and 12271 transitions. [2018-09-10 10:23:19,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 10:23:19,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-09-10 10:23:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:19,685 INFO L225 Difference]: With dead ends: 7268 [2018-09-10 10:23:19,685 INFO L226 Difference]: Without dead ends: 4833 [2018-09-10 10:23:19,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 559 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:23:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2018-09-10 10:23:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4676. [2018-09-10 10:23:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2018-09-10 10:23:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 6778 transitions. [2018-09-10 10:23:19,896 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 6778 transitions. Word has length 140 [2018-09-10 10:23:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:19,896 INFO L480 AbstractCegarLoop]: Abstraction has 4676 states and 6778 transitions. [2018-09-10 10:23:19,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:23:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 6778 transitions. [2018-09-10 10:23:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-10 10:23:19,911 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:19,912 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-10 10:23:19,912 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2021456170, now seen corresponding path program 1 times [2018-09-10 10:23:19,912 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:19,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:19,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:19,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:19,914 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:20,141 WARN L175 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:23:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:23:20,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:20,278 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:20,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:20,285 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:20,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:23:20,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:23:20,644 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:23:20,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2018-09-10 10:23:20,644 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:20,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:20,645 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:20,645 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:23:20,645 INFO L87 Difference]: Start difference. First operand 4676 states and 6778 transitions. Second operand 5 states. [2018-09-10 10:23:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:22,289 INFO L93 Difference]: Finished difference Result 10638 states and 15520 transitions. [2018-09-10 10:23:22,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:23:22,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-09-10 10:23:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:22,324 INFO L225 Difference]: With dead ends: 10638 [2018-09-10 10:23:22,324 INFO L226 Difference]: Without dead ends: 5968 [2018-09-10 10:23:22,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:23:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2018-09-10 10:23:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 5575. [2018-09-10 10:23:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5575 states. [2018-09-10 10:23:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 7637 transitions. [2018-09-10 10:23:22,582 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 7637 transitions. Word has length 139 [2018-09-10 10:23:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:22,583 INFO L480 AbstractCegarLoop]: Abstraction has 5575 states and 7637 transitions. [2018-09-10 10:23:22,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 7637 transitions. [2018-09-10 10:23:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-10 10:23:22,607 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:22,607 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-09-10 10:23:22,608 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:22,608 INFO L82 PathProgramCache]: Analyzing trace with hash 297756808, now seen corresponding path program 1 times [2018-09-10 10:23:22,608 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:22,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:22,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:22,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:22,610 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 99 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:23:23,468 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:23,468 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:23,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:23,478 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:23,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:23:23,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:23:23,924 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:23,925 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 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:23,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:23,940 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:24,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:23:24,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:23:24,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:24,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 17 [2018-09-10 10:23:24,458 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:24,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-10 10:23:24,458 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-10 10:23:24,459 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:23:24,459 INFO L87 Difference]: Start difference. First operand 5575 states and 7637 transitions. Second operand 10 states. [2018-09-10 10:23:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:29,157 INFO L93 Difference]: Finished difference Result 24366 states and 40570 transitions. [2018-09-10 10:23:29,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-10 10:23:29,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2018-09-10 10:23:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:29,297 INFO L225 Difference]: With dead ends: 24366 [2018-09-10 10:23:29,298 INFO L226 Difference]: Without dead ends: 18797 [2018-09-10 10:23:29,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 725 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-09-10 10:23:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18797 states. [2018-09-10 10:23:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18797 to 17830. [2018-09-10 10:23:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17830 states. [2018-09-10 10:23:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17830 states to 17830 states and 24157 transitions. [2018-09-10 10:23:30,239 INFO L78 Accepts]: Start accepts. Automaton has 17830 states and 24157 transitions. Word has length 182 [2018-09-10 10:23:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:30,239 INFO L480 AbstractCegarLoop]: Abstraction has 17830 states and 24157 transitions. [2018-09-10 10:23:30,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-10 10:23:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 17830 states and 24157 transitions. [2018-09-10 10:23:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-10 10:23:30,339 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:30,340 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,340 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:30,343 INFO L82 PathProgramCache]: Analyzing trace with hash 487893264, now seen corresponding path program 1 times [2018-09-10 10:23:30,343 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:30,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:30,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:30,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:30,344 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 175 proven. 47 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-10 10:23:30,854 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:30,855 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:30,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:30,870 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:30,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-10 10:23:31,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-10 10:23:31,943 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:31,943 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:31,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:31,959 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:32,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-10 10:23:32,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-10 10:23:32,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:32,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-10 10:23:32,479 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:32,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:23:32,480 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:23:32,480 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:23:32,481 INFO L87 Difference]: Start difference. First operand 17830 states and 24157 transitions. Second operand 9 states. [2018-09-10 10:23:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:35,559 INFO L93 Difference]: Finished difference Result 25992 states and 34840 transitions. [2018-09-10 10:23:35,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-10 10:23:35,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2018-09-10 10:23:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:35,560 INFO L225 Difference]: With dead ends: 25992 [2018-09-10 10:23:35,560 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:23:35,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 1001 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2018-09-10 10:23:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:23:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:23:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:23:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:23:35,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2018-09-10 10:23:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:35,644 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:23:35,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:23:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:23:35,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:23:35,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:23:36,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,401 WARN L175 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 111 [2018-09-10 10:23:36,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,769 WARN L175 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 111 [2018-09-10 10:23:37,131 WARN L175 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-10 10:23:37,255 WARN L175 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2018-09-10 10:23:40,754 WARN L175 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 174 DAG size of output: 82 [2018-09-10 10:23:41,448 WARN L175 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 59 [2018-09-10 10:23:42,120 WARN L175 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 59 [2018-09-10 10:23:42,123 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,123 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,123 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,123 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,124 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,124 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-10 10:23:42,124 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-10 10:23:42,124 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-10 10:23:42,124 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-10 10:23:42,124 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-10 10:23:42,124 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-10 10:23:42,124 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-10 10:23:42,124 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-10 10:23:42,125 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-10 10:23:42,125 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-10 10:23:42,125 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:23:42,125 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:23:42,125 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-10 10:23:42,125 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,125 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,125 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,126 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,126 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-10 10:23:42,126 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,126 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-10 10:23:42,126 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-10 10:23:42,126 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-10 10:23:42,126 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-10 10:23:42,126 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-10 10:23:42,126 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-10 10:23:42,127 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-10 10:23:42,127 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:23:42,127 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:23:42,127 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-10 10:23:42,127 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-10 10:23:42,127 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-10 10:23:42,127 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:23:42,127 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:23:42,127 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-10 10:23:42,128 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,128 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,128 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,128 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,128 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,128 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:23:42,128 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-10 10:23:42,128 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:23:42,128 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,129 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-10 10:23:42,129 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-10 10:23:42,129 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-10 10:23:42,129 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-10 10:23:42,129 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-10 10:23:42,129 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,129 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 442) no Hoare annotation was computed. [2018-09-10 10:23:42,129 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-10 10:23:42,130 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-10 10:23:42,130 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-10 10:23:42,130 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,130 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,130 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,130 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,130 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,130 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-10 10:23:42,131 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-10 10:23:42,131 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-10 10:23:42,131 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-10 10:23:42,131 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-10 10:23:42,131 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-10 10:23:42,131 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-10 10:23:42,131 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-10 10:23:42,131 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-10 10:23:42,131 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-10 10:23:42,132 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-10 10:23:42,132 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-10 10:23:42,132 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-10 10:23:42,132 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,132 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,132 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,132 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,132 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,132 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-10 10:23:42,133 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-10 10:23:42,134 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-10 10:23:42,134 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-10 10:23:42,134 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:23:42,134 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-10 10:23:42,134 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:23:42,134 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,134 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,134 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,134 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,135 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-10 10:23:42,135 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,135 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:23:42,135 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,135 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:23:42,135 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:23:42,135 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:23:42,135 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-10 10:23:42,135 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-10 10:23:42,136 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-10 10:23:42,136 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-10 10:23:42,136 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-10 10:23:42,136 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-10 10:23:42,136 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-10 10:23:42,136 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-10 10:23:42,136 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-10 10:23:42,136 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-10 10:23:42,136 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-10 10:23:42,137 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,137 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,137 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,137 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,137 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,137 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,137 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-10 10:23:42,137 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-10 10:23:42,137 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,138 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,139 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,139 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,139 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,139 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,139 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-10 10:23:42,139 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-10 10:23:42,139 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-10 10:23:42,139 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-10 10:23:42,139 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-10 10:23:42,140 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-10 10:23:42,140 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-10 10:23:42,140 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-10 10:23:42,140 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-10 10:23:42,140 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-10 10:23:42,140 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-10 10:23:42,140 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-10 10:23:42,140 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-10 10:23:42,140 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-10 10:23:42,141 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,141 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,141 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,141 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,141 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,141 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,141 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-10 10:23:42,141 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-10 10:23:42,141 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-10 10:23:42,142 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-10 10:23:42,142 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-10 10:23:42,142 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-10 10:23:42,142 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-10 10:23:42,142 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-10 10:23:42,142 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-10 10:23:42,142 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-10 10:23:42,142 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-10 10:23:42,142 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-10 10:23:42,143 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-10 10:23:42,144 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-10 10:23:42,144 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-10 10:23:42,144 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-10 10:23:42,144 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-10 10:23:42,144 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-10 10:23:42,144 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-10 10:23:42,144 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-10 10:23:42,144 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-10 10:23:42,144 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:42,145 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-10 10:23:42,146 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-10 10:23:42,146 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-10 10:23:42,146 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-10 10:23:42,146 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-10 10:23:42,147 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse8 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse17 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|))) (let ((.cse2 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9))) (.cse16 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|)) (.cse15 (and .cse0 .cse8 .cse17 .cse9)) (.cse7 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse13 (and .cse8 .cse17 .cse9)) (.cse10 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) (.cse12 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1))) (.cse6 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10)) (.cse11 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse5 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1)) (.cse14 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) (.cse4 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse1 .cse5 .cse6 .cse4 (and .cse7 .cse8 .cse9)) (or .cse1 .cse2 .cse5 .cse10 .cse11 .cse12) (or .cse13 .cse1 .cse10 .cse3 .cse12) (or .cse1 .cse5 .cse3 .cse0 .cse14 .cse4) (or .cse15 (or .cse16 .cse1 .cse10 .cse3 .cse4)) (or .cse16 .cse1 .cse5 .cse10 .cse11 .cse12) (or .cse1 .cse2 (and .cse7 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse9) .cse4) (or .cse1 (and .cse11 .cse0 .cse8 .cse17 .cse9) .cse5 .cse10 .cse3 .cse4) (or .cse1 .cse5 .cse12 .cse6 (and .cse11 .cse7 .cse8 .cse9)) (or .cse16 .cse1 .cse5 .cse10 (and .cse11 .cse8 .cse17 .cse9) .cse4) (or .cse16 .cse1 .cse13 .cse10 .cse12) (or .cse1 .cse15 .cse10 .cse3 .cse14 .cse4) (or .cse0 .cse1 .cse10 .cse3 .cse12) (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7)) .cse1 (not .cse5) .cse12 (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) .cse7 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7)) (not .cse3)) (or .cse13 .cse1 .cse10 .cse12 .cse14) (or .cse1 .cse5 .cse3 .cse12 .cse6 .cse0) (or .cse11 .cse1 .cse5 .cse14 .cse4)))) [2018-09-10 10:23:42,147 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-10 10:23:42,147 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-10 10:23:42,147 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-10 10:23:42,147 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-10 10:23:42,147 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-10 10:23:42,147 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-10 10:23:42,147 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:23:42,147 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-10 10:23:42,148 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:23:42,148 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-10 10:23:42,148 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:23:42,148 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:23:42,148 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-10 10:23:42,148 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-10 10:23:42,148 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:23:42,148 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) [2018-09-10 10:23:42,148 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:23:42,149 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:23:42,149 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) [2018-09-10 10:23:42,149 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:23:42,149 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:23:42,149 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|))) [2018-09-10 10:23:42,149 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-10 10:23:42,149 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse2 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 11)) .cse2 .cse3) (and .cse0 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) .cse4) (and .cse0 (and .cse5 .cse6 .cse3)) (and .cse0 .cse5 .cse1 .cse3) (and .cse6 .cse3 .cse4) (and .cse2 .cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (and .cse1 .cse3 .cse4) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (and .cse5 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) (and .cse0 .cse5 .cse2) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse0 .cse1 .cse6 .cse3))) [2018-09-10 10:23:42,150 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:23:42,150 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:23:42,150 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse5 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse2 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 11)) .cse2 .cse3) (and .cse0 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) .cse4) (and .cse0 (and .cse5 .cse6 .cse3)) (and .cse0 .cse5 .cse1 .cse3) (and .cse6 .cse3 .cse4) (and .cse2 .cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (and .cse1 .cse3 .cse4) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (and .cse5 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) (and .cse0 .cse5 .cse2) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse0 .cse1 .cse6 .cse3))) [2018-09-10 10:23:42,150 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-10 10:23:42,150 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-10 10:23:42,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:23:42 BoogieIcfgContainer [2018-09-10 10:23:42,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:23:42,175 INFO L168 Benchmark]: Toolchain (without parser) took 46477.38 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -312.9 MB). Peak memory consumption was 883.5 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:42,176 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:23:42,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:42,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:23:42,178 INFO L168 Benchmark]: Boogie Preprocessor took 182.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:42,179 INFO L168 Benchmark]: RCFGBuilder took 3339.86 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.2 MB). Peak memory consumption was 120.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:42,180 INFO L168 Benchmark]: TraceAbstraction took 42114.42 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 464.5 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 355.4 MB). Peak memory consumption was 819.9 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:42,185 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 103.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3339.86 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.2 MB). Peak memory consumption was 120.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42114.42 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 464.5 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 355.4 MB). Peak memory consumption was 819.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 442]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || ((((7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 7) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 7 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19))) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) == 1)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || 7 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) == 1) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 8)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) == 1) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 7) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 42.0s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 6.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1385 SDtfs, 7414 SDslu, 1355 SDs, 0 SdLazy, 10467 SolverSat, 2074 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3372 GetRequests, 3232 SyntacticMatches, 27 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17830occurred in iteration=8, 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: 1.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 1565 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 617 PreInvPairs, 879 NumberOfFragments, 890 HoareAnnotationTreeSize, 617 FomulaSimplifications, 17791 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5232 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2884 NumberOfCodeBlocks, 2884 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4474 ConstructedInterpolants, 0 QuantifiedInterpolants, 1731085 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4412 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 2380/2520 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label41_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-23-42-204.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label41_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-23-42-204.csv Received shutdown request...