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_label40_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:22:53,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:22:53,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:22:53,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:22:53,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:22:53,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:22:53,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:22:53,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:22:53,156 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:22:53,157 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:22:53,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:22:53,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:22:53,161 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:22:53,162 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:22:53,163 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:22:53,164 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:22:53,165 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:22:53,167 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:22:53,169 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:22:53,170 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:22:53,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:22:53,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:22:53,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:22:53,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:22:53,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:22:53,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:22:53,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:22:53,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:22:53,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:22:53,181 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:22:53,181 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:22:53,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:22:53,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:22:53,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:22:53,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:22:53,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:22:53,184 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:53,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:22:53,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:22:53,209 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:22:53,209 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:22:53,210 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:22:53,210 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:22:53,210 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:22:53,210 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:22:53,211 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:22:53,211 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:22:53,211 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:22:53,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:22:53,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:22:53,213 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:22:53,213 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:22:53,213 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:22:53,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:22:53,213 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:22:53,214 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:22:53,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:22:53,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:22:53,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:22:53,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:22:53,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:22:53,217 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:22:53,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:22:53,217 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:22:53,217 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:22:53,217 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:22:53,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:22:53,218 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:22:53,218 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:22:53,218 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:22:53,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:22:53,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:22:53,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:22:53,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:22:53,315 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:22:53,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label40_true-unreach-call_false-termination.c [2018-09-10 10:22:53,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a85a1264/d0b0dda689404e77be6902514f8b8318/FLAG83909f065 [2018-09-10 10:22:53,959 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:22:53,965 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label40_true-unreach-call_false-termination.c [2018-09-10 10:22:53,992 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a85a1264/d0b0dda689404e77be6902514f8b8318/FLAG83909f065 [2018-09-10 10:22:54,006 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a85a1264/d0b0dda689404e77be6902514f8b8318 [2018-09-10 10:22:54,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:22:54,020 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:22:54,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:22:54,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:22:54,029 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:22:54,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:22:54" (1/1) ... [2018-09-10 10:22:54,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423cff25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:54, skipping insertion in model container [2018-09-10 10:22:54,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:22:54" (1/1) ... [2018-09-10 10:22:54,275 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:22:54,606 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:22:54,623 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:22:54,776 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:22:54,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:54 WrapperNode [2018-09-10 10:22:54,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:22:54,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:22:54,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:22:54,821 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:22:54,833 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:54" (1/1) ... [2018-09-10 10:22:54,851 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:54" (1/1) ... [2018-09-10 10:22:54,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:22:54,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:22:54,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:22:54,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:22:55,025 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:54" (1/1) ... [2018-09-10 10:22:55,025 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:54" (1/1) ... [2018-09-10 10:22:55,033 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:54" (1/1) ... [2018-09-10 10:22:55,034 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:54" (1/1) ... [2018-09-10 10:22:55,053 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:54" (1/1) ... [2018-09-10 10:22:55,076 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:54" (1/1) ... [2018-09-10 10:22:55,084 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:54" (1/1) ... [2018-09-10 10:22:55,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:22:55,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:22:55,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:22:55,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:22:55,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:54" (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:55,176 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:55,176 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:55,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:22:55,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:22:55,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:22:55,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:22:55,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:22:55,177 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:22:58,710 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:22:58,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:22:58 BoogieIcfgContainer [2018-09-10 10:22:58,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:22:58,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:22:58,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:22:58,719 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:22:58,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:22:54" (1/3) ... [2018-09-10 10:22:58,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0117d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:22:58, skipping insertion in model container [2018-09-10 10:22:58,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:54" (2/3) ... [2018-09-10 10:22:58,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0117d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:22:58, skipping insertion in model container [2018-09-10 10:22:58,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:22:58" (3/3) ... [2018-09-10 10:22:58,723 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label40_true-unreach-call_false-termination.c [2018-09-10 10:22:58,732 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:22:58,740 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:22:58,788 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:22:58,788 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:22:58,788 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:22:58,789 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:22:58,789 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:22:58,789 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:22:58,789 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:22:58,789 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:22:58,789 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:22:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-10 10:22:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-10 10:22:58,830 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:22:58,831 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] [2018-09-10 10:22:58,832 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:22:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash 754560056, now seen corresponding path program 1 times [2018-09-10 10:22:58,840 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:22:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:58,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:22:58,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:22:58,899 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:22:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:22:59,476 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:22:59,478 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:22:59,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:22:59,479 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:22:59,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:22:59,502 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:22:59,502 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:22:59,505 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-10 10:23:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:01,421 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-09-10 10:23:01,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:01,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-10 10:23:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:01,444 INFO L225 Difference]: With dead ends: 621 [2018-09-10 10:23:01,444 INFO L226 Difference]: Without dead ends: 382 [2018-09-10 10:23:01,451 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:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-10 10:23:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-10 10:23:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-10 10:23:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-09-10 10:23:01,533 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 96 [2018-09-10 10:23:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:01,534 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-09-10 10:23:01,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-09-10 10:23:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-10 10:23:01,543 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:01,544 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] [2018-09-10 10:23:01,544 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:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash 168345091, now seen corresponding path program 1 times [2018-09-10 10:23:01,545 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:01,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:01,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:01,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:01,546 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:01,750 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:01,751 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:01,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 10:23:01,751 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:01,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:23:01,755 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:23:01,756 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:23:01,756 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 4 states. [2018-09-10 10:23:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:03,777 INFO L93 Difference]: Finished difference Result 1344 states and 2271 transitions. [2018-09-10 10:23:03,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:03,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-09-10 10:23:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:03,789 INFO L225 Difference]: With dead ends: 1344 [2018-09-10 10:23:03,789 INFO L226 Difference]: Without dead ends: 968 [2018-09-10 10:23:03,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:23:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-09-10 10:23:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 964. [2018-09-10 10:23:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-09-10 10:23:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1468 transitions. [2018-09-10 10:23:03,868 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1468 transitions. Word has length 105 [2018-09-10 10:23:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:03,869 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1468 transitions. [2018-09-10 10:23:03,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:23:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1468 transitions. [2018-09-10 10:23:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-10 10:23:03,878 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:03,878 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] [2018-09-10 10:23:03,879 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:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash -551042633, now seen corresponding path program 1 times [2018-09-10 10:23:03,879 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:03,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:03,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:03,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:03,881 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:04,072 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:04,073 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:04,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:04,073 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:04,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:04,074 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:04,074 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:04,074 INFO L87 Difference]: Start difference. First operand 964 states and 1468 transitions. Second operand 3 states. [2018-09-10 10:23:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:06,218 INFO L93 Difference]: Finished difference Result 2793 states and 4411 transitions. [2018-09-10 10:23:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:06,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-09-10 10:23:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:06,237 INFO L225 Difference]: With dead ends: 2793 [2018-09-10 10:23:06,237 INFO L226 Difference]: Without dead ends: 1835 [2018-09-10 10:23:06,244 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:06,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2018-09-10 10:23:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1835. [2018-09-10 10:23:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2018-09-10 10:23:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2630 transitions. [2018-09-10 10:23:06,334 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2630 transitions. Word has length 111 [2018-09-10 10:23:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:06,334 INFO L480 AbstractCegarLoop]: Abstraction has 1835 states and 2630 transitions. [2018-09-10 10:23:06,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2630 transitions. [2018-09-10 10:23:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-10 10:23:06,342 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:06,343 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] [2018-09-10 10:23:06,343 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:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash 785379476, now seen corresponding path program 1 times [2018-09-10 10:23:06,345 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:06,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:06,346 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:06,616 WARN L175 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:23:06,901 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:06,901 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:06,901 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:06,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:06,913 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:07,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:07,527 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,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:07,953 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,984 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:07,984 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:08,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:08,019 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:08,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:08,374 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,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:08,492 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,494 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-09-10 10:23:08,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5] total 13 [2018-09-10 10:23:08,495 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:08,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:08,497 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:08,497 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:23:08,497 INFO L87 Difference]: Start difference. First operand 1835 states and 2630 transitions. Second operand 5 states. [2018-09-10 10:23:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:10,976 INFO L93 Difference]: Finished difference Result 5493 states and 8311 transitions. [2018-09-10 10:23:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:23:10,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2018-09-10 10:23:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:11,010 INFO L225 Difference]: With dead ends: 5493 [2018-09-10 10:23:11,011 INFO L226 Difference]: Without dead ends: 3664 [2018-09-10 10:23:11,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 452 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:23:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2018-09-10 10:23:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3604. [2018-09-10 10:23:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3604 states. [2018-09-10 10:23:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 5086 transitions. [2018-09-10 10:23:11,163 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 5086 transitions. Word has length 116 [2018-09-10 10:23:11,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:11,163 INFO L480 AbstractCegarLoop]: Abstraction has 3604 states and 5086 transitions. [2018-09-10 10:23:11,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 5086 transitions. [2018-09-10 10:23:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-10 10:23:11,170 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:11,171 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] [2018-09-10 10:23:11,171 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:11,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2002092664, now seen corresponding path program 1 times [2018-09-10 10:23:11,171 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:11,173 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:11,622 WARN L175 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-10 10:23:11,870 WARN L175 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 10:23:12,200 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:12,200 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:12,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:23:12,201 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:12,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:12,201 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:12,201 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:12,202 INFO L87 Difference]: Start difference. First operand 3604 states and 5086 transitions. Second operand 5 states. [2018-09-10 10:23:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:14,068 INFO L93 Difference]: Finished difference Result 7347 states and 10505 transitions. [2018-09-10 10:23:14,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:14,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2018-09-10 10:23:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:14,097 INFO L225 Difference]: With dead ends: 7347 [2018-09-10 10:23:14,097 INFO L226 Difference]: Without dead ends: 3601 [2018-09-10 10:23:14,113 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:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3601 states. [2018-09-10 10:23:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3601 to 3601. [2018-09-10 10:23:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3601 states. [2018-09-10 10:23:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 4995 transitions. [2018-09-10 10:23:14,236 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 4995 transitions. Word has length 123 [2018-09-10 10:23:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:14,236 INFO L480 AbstractCegarLoop]: Abstraction has 3601 states and 4995 transitions. [2018-09-10 10:23:14,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 4995 transitions. [2018-09-10 10:23:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-10 10:23:14,245 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:14,245 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,245 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:14,246 INFO L82 PathProgramCache]: Analyzing trace with hash 71542137, now seen corresponding path program 1 times [2018-09-10 10:23:14,246 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:14,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:14,247 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:14,471 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:14,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:23:14,472 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:14,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:23:14,472 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:23:14,473 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:23:14,473 INFO L87 Difference]: Start difference. First operand 3601 states and 4995 transitions. Second operand 6 states. [2018-09-10 10:23:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:15,986 INFO L93 Difference]: Finished difference Result 11131 states and 15993 transitions. [2018-09-10 10:23:15,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:23:15,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-09-10 10:23:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:16,027 INFO L225 Difference]: With dead ends: 11131 [2018-09-10 10:23:16,028 INFO L226 Difference]: Without dead ends: 7536 [2018-09-10 10:23:16,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:23:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2018-09-10 10:23:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 7344. [2018-09-10 10:23:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7344 states. [2018-09-10 10:23:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7344 states to 7344 states and 10041 transitions. [2018-09-10 10:23:16,256 INFO L78 Accepts]: Start accepts. Automaton has 7344 states and 10041 transitions. Word has length 151 [2018-09-10 10:23:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:16,257 INFO L480 AbstractCegarLoop]: Abstraction has 7344 states and 10041 transitions. [2018-09-10 10:23:16,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:23:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7344 states and 10041 transitions. [2018-09-10 10:23:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-10 10:23:16,269 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:16,270 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:16,270 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:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash 54676864, now seen corresponding path program 1 times [2018-09-10 10:23:16,270 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:16,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:16,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:16,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:16,272 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:16,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:16,736 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:16,757 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:16,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:16,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:17,209 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:17,209 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:17,231 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:17,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 62 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:17,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:17,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:17,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 7, 8] total 12 [2018-09-10 10:23:17,785 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:17,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:23:17,787 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:23:17,787 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:23:17,787 INFO L87 Difference]: Start difference. First operand 7344 states and 10041 transitions. Second operand 6 states. [2018-09-10 10:23:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:19,646 INFO L93 Difference]: Finished difference Result 13670 states and 18982 transitions. [2018-09-10 10:23:19,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:23:19,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-09-10 10:23:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:19,673 INFO L225 Difference]: With dead ends: 13670 [2018-09-10 10:23:19,674 INFO L226 Difference]: Without dead ends: 6332 [2018-09-10 10:23:19,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 646 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:23:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6332 states. [2018-09-10 10:23:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6332 to 5988. [2018-09-10 10:23:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5988 states. [2018-09-10 10:23:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5988 states to 5988 states and 7407 transitions. [2018-09-10 10:23:19,849 INFO L78 Accepts]: Start accepts. Automaton has 5988 states and 7407 transitions. Word has length 165 [2018-09-10 10:23:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:19,849 INFO L480 AbstractCegarLoop]: Abstraction has 5988 states and 7407 transitions. [2018-09-10 10:23:19,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:23:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 5988 states and 7407 transitions. [2018-09-10 10:23:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-10 10:23:19,863 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:19,863 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,864 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:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1157819366, now seen corresponding path program 1 times [2018-09-10 10:23:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:19,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:19,866 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 101 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:23:20,282 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:20,282 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:20,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:20,292 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:20,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 107 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-10 10:23:20,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:23:21,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:21,952 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 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:21,987 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:22,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 107 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-10 10:23:22,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:23:23,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:23,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 16 [2018-09-10 10:23:23,422 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:23,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:23:23,424 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:23:23,424 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:23:23,424 INFO L87 Difference]: Start difference. First operand 5988 states and 7407 transitions. Second operand 13 states. [2018-09-10 10:23:24,234 WARN L175 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:23:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:29,646 INFO L93 Difference]: Finished difference Result 13101 states and 18324 transitions. [2018-09-10 10:23:29,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-10 10:23:29,647 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 202 [2018-09-10 10:23:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:29,692 INFO L225 Difference]: With dead ends: 13101 [2018-09-10 10:23:29,693 INFO L226 Difference]: Without dead ends: 7119 [2018-09-10 10:23:29,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 827 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=563, Invalid=1599, Unknown=0, NotChecked=0, Total=2162 [2018-09-10 10:23:29,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7119 states. [2018-09-10 10:23:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7119 to 6330. [2018-09-10 10:23:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6330 states. [2018-09-10 10:23:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6330 states to 6330 states and 7367 transitions. [2018-09-10 10:23:29,903 INFO L78 Accepts]: Start accepts. Automaton has 6330 states and 7367 transitions. Word has length 202 [2018-09-10 10:23:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:29,904 INFO L480 AbstractCegarLoop]: Abstraction has 6330 states and 7367 transitions. [2018-09-10 10:23:29,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:23:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 6330 states and 7367 transitions. [2018-09-10 10:23:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-10 10:23:29,918 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:29,919 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:29,919 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:29,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1739050706, now seen corresponding path program 1 times [2018-09-10 10:23:29,920 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:29,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:29,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:29,921 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:30,155 WARN L175 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:23:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 126 proven. 48 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-09-10 10:23:30,653 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:30,654 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:30,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:30,671 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:30,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-09-10 10:23:30,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 126 proven. 48 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-09-10 10:23:31,065 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:23:31,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 10:23:31,066 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:31,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:31,067 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:31,067 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:23:31,067 INFO L87 Difference]: Start difference. First operand 6330 states and 7367 transitions. Second operand 5 states. [2018-09-10 10:23:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:32,365 INFO L93 Difference]: Finished difference Result 12723 states and 14802 transitions. [2018-09-10 10:23:32,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:23:32,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2018-09-10 10:23:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:32,383 INFO L225 Difference]: With dead ends: 12723 [2018-09-10 10:23:32,383 INFO L226 Difference]: Without dead ends: 6544 [2018-09-10 10:23:32,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 465 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:23:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2018-09-10 10:23:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 6323. [2018-09-10 10:23:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6323 states. [2018-09-10 10:23:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 7182 transitions. [2018-09-10 10:23:32,513 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 7182 transitions. Word has length 235 [2018-09-10 10:23:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:32,513 INFO L480 AbstractCegarLoop]: Abstraction has 6323 states and 7182 transitions. [2018-09-10 10:23:32,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 7182 transitions. [2018-09-10 10:23:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-10 10:23:32,528 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:32,528 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 10:23:32,528 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__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:32,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1411355239, now seen corresponding path program 1 times [2018-09-10 10:23:32,529 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:32,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:32,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:32,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:32,530 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 232 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:33,321 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:33,321 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:33,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:33,332 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:33,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:34,601 WARN L175 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-09-10 10:23:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-10 10:23:34,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-10 10:23:34,986 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:34,986 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 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:35,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:35,002 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:35,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 51 proven. 179 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-10 10:23:35,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-09-10 10:23:35,448 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:23:35,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [16, 6, 6, 4] total 23 [2018-09-10 10:23:35,449 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:35,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:35,450 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:35,450 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-09-10 10:23:35,451 INFO L87 Difference]: Start difference. First operand 6323 states and 7182 transitions. Second operand 3 states. [2018-09-10 10:23:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:36,128 INFO L93 Difference]: Finished difference Result 12641 states and 14358 transitions. [2018-09-10 10:23:36,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:36,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-09-10 10:23:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:36,129 INFO L225 Difference]: With dead ends: 12641 [2018-09-10 10:23:36,129 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:23:36,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 974 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-09-10 10:23:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:23:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:23:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:23:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:23:36,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-09-10 10:23:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:36,146 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:23:36,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:23:36,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:23:36,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:23:36,257 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,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,744 WARN L175 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 158 [2018-09-10 10:23:36,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:36,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:37,253 WARN L175 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 158 [2018-09-10 10:23:37,641 WARN L175 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-10 10:23:38,027 WARN L175 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-09-10 10:23:42,054 WARN L175 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 154 DAG size of output: 71 [2018-09-10 10:23:42,929 WARN L175 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 53 [2018-09-10 10:23:43,680 WARN L175 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 53 [2018-09-10 10:23:43,683 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,683 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,683 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,683 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,683 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,683 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-10 10:23:43,683 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:23:43,684 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-10 10:23:43,685 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-10 10:23:43,686 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-10 10:23:43,686 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-10 10:23:43,686 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-10 10:23:43,686 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:23:43,686 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:23:43,686 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-10 10:23:43,686 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-10 10:23:43,686 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-10 10:23:43,687 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:23:43,687 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:23:43,687 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-10 10:23:43,687 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,687 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,687 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,687 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,687 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,687 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:23:43,688 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-10 10:23:43,688 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:23:43,688 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:43,688 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-10 10:23:43,688 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-10 10:23:43,688 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-10 10:23:43,688 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-10 10:23:43,688 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-10 10:23:43,689 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:43,689 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-10 10:23:43,689 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-10 10:23:43,689 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-10 10:23:43,689 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,689 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,689 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,689 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,689 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,690 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-10 10:23:43,690 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-10 10:23:43,690 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-10 10:23:43,690 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-10 10:23:43,690 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-10 10:23:43,690 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-10 10:23:43,690 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-10 10:23:43,690 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-10 10:23:43,690 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-10 10:23:43,691 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-10 10:23:43,691 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-10 10:23:43,691 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-10 10:23:43,691 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-10 10:23:43,691 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,691 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,691 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,691 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,691 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,692 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-10 10:23:43,692 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-10 10:23:43,692 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-10 10:23:43,692 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-10 10:23:43,692 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-10 10:23:43,692 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-10 10:23:43,692 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-10 10:23:43,692 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 439) no Hoare annotation was computed. [2018-09-10 10:23:43,693 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-10 10:23:43,693 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-10 10:23:43,693 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-10 10:23:43,693 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-10 10:23:43,693 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-10 10:23:43,693 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-10 10:23:43,693 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:23:43,693 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-10 10:23:43,693 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:23:43,694 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,694 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,694 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,694 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,694 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-10 10:23:43,694 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,694 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:23:43,694 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-10 10:23:43,695 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,696 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-10 10:23:43,697 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-10 10:23:43,698 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-10 10:23:43,698 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,698 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,698 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,698 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,698 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,698 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,698 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-10 10:23:43,698 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-10 10:23:43,699 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-10 10:23:43,700 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-10 10:23:43,701 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-10 10:23:43,702 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-10 10:23:43,702 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,702 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,702 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,702 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,702 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,702 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,702 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-10 10:23:43,702 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-10 10:23:43,703 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:43,704 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-10 10:23:43,705 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-10 10:23:43,705 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-10 10:23:43,705 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-10 10:23:43,705 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-10 10:23:43,706 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 ((.cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (.cse7 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1)) (.cse14 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (.cse4 (= ~__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__a28~0)|)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse6 (= ~__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 ((.cse0 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|)) (.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse9 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 8)) (.cse16 (and .cse14 .cse10 .cse4 .cse5 .cse6)) (.cse8 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (.cse17 (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse19 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9))) (.cse18 (= |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 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse11 (not .cse7)) (.cse12 (not .cse2)) (.cse15 (= |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 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6) .cse7 .cse8) (or .cse9 .cse1 (and .cse10 .cse4 .cse5 .cse6) .cse8 .cse11 .cse12) (or .cse0 .cse1 .cse8 .cse13 (and .cse3 .cse14 .cse15 .cse4 .cse6)) (or .cse1 .cse8 .cse11 .cse16 .cse13 .cse12) (or .cse17 .cse9 .cse1 (and .cse3 .cse15 .cse4 .cse6) .cse7 .cse18) (or .cse17 .cse9 .cse14 .cse1 .cse7 .cse13 .cse18) (or .cse14 .cse17 .cse1 .cse2 .cse19 .cse13) (or (and .cse3 .cse14 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse7 .cse8 .cse13)) (or .cse9 .cse16 (or .cse1 .cse8 .cse13) .cse11) (or .cse17 .cse1 .cse2 .cse19 (and .cse10 .cse15 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse6) .cse11) (or (not .cse18) .cse1 .cse11 .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) .cse15 (= 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 .cse13))))) [2018-09-10 10:23:43,706 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-10 10:23:43,706 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-10 10:23:43,706 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-10 10:23:43,706 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-10 10:23:43,706 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-10 10:23:43,706 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-10 10:23:43,706 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:23:43,706 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-10 10:23:43,706 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:23:43,707 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-10 10:23:43,707 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:23:43,707 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:23:43,707 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-10 10:23:43,707 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-10 10:23:43,707 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:23:43,707 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__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| ~__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__a28~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__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:43,707 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:23:43,707 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:23:43,708 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:43,708 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:23:43,708 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:23:43,708 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 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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) (= ~__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__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:43,708 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-10 10:23:43,708 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse5 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (let ((.cse8 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse4 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse0 (not .cse6)) (.cse1 (not .cse5)) (.cse7 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 8))) (.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= 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) .cse5) (and .cse6 (and .cse7 .cse3 .cse5)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse1 .cse8 (= 9 ~__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)) (and .cse0 .cse8 .cse2 (not .cse4)) (and .cse0 .cse1 .cse7 .cse3) (and .cse6 .cse2 .cse3 .cse5) (and .cse7 (= ~__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__a28~0)|) .cse3) (< 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) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (and .cse6 .cse7 .cse2 .cse3)))) [2018-09-10 10:23:43,709 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:23:43,709 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:23:43,709 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse5 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (let ((.cse8 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse4 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse0 (not .cse6)) (.cse1 (not .cse5)) (.cse7 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 8))) (.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= 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) .cse5) (and .cse6 (and .cse7 .cse3 .cse5)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and .cse1 .cse8 (= 9 ~__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)) (and .cse0 .cse8 .cse2 (not .cse4)) (and .cse0 .cse1 .cse7 .cse3) (and .cse6 .cse2 .cse3 .cse5) (and .cse7 (= ~__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__a28~0)|) .cse3) (< 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) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8)) (and .cse6 .cse7 .cse2 .cse3)))) [2018-09-10 10:23:43,709 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-10 10:23:43,709 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-10 10:23:43,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:23:43 BoogieIcfgContainer [2018-09-10 10:23:43,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:23:43,732 INFO L168 Benchmark]: Toolchain (without parser) took 49715.12 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -391.2 MB). Peak memory consumption was 838.8 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:43,734 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:23:43,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:43,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.18 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:43,735 INFO L168 Benchmark]: Boogie Preprocessor took 202.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.6 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:43,736 INFO L168 Benchmark]: RCFGBuilder took 3608.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.3 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:43,737 INFO L168 Benchmark]: TraceAbstraction took 45019.05 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 479.7 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 284.8 MB). Peak memory consumption was 764.5 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:43,742 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.18 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 202.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.6 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3608.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.3 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45019.05 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 479.7 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 284.8 MB). Peak memory consumption was 764.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: 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__a25 == 1) && !(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__a28 == 8)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) || ((((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__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) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) == 1)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) == 1) || ((!(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__a17 <= 8) && 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__a21 == 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__a17 <= 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 8)) && !(7 == __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__a25 == 1) && !(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__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__a25 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 8)) && __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)) || ((!(__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 == \old(__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)) || 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) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 8)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__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__a28 == 8)) && __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, 44.9s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 7.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1775 SDtfs, 6891 SDslu, 1117 SDs, 0 SdLazy, 8141 SolverSat, 2288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3524 GetRequests, 3376 SyntacticMatches, 31 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7344occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 1610 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 273 PreInvPairs, 355 NumberOfFragments, 743 HoareAnnotationTreeSize, 273 FomulaSimplifications, 27281 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8118 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 3243 NumberOfCodeBlocks, 3243 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4908 ConstructedInterpolants, 0 QuantifiedInterpolants, 2844406 SizeOfPredicates, 13 NumberOfNonLiveVariables, 4191 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 2959/3429 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_label40_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-23-43-760.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label40_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-23-43-760.csv Received shutdown request...