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_label48_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:22:57,117 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:22:57,119 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:22:57,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:22:57,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:22:57,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:22:57,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:22:57,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:22:57,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:22:57,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:22:57,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:22:57,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:22:57,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:22:57,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:22:57,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:22:57,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:22:57,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:22:57,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:22:57,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:22:57,188 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:22:57,189 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:22:57,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:22:57,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:22:57,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:22:57,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:22:57,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:22:57,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:22:57,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:22:57,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:22:57,205 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:22:57,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:22:57,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:22:57,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:22:57,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:22:57,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:22:57,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:22:57,213 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:57,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:22:57,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:22:57,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:22:57,243 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:22:57,244 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:22:57,244 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:22:57,244 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:22:57,245 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:22:57,245 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:22:57,245 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:22:57,245 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:22:57,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:22:57,246 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:22:57,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:22:57,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:22:57,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:22:57,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:22:57,247 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:22:57,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:22:57,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:22:57,248 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:22:57,248 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:22:57,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:22:57,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:22:57,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:22:57,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:22:57,251 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:22:57,251 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:22:57,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:22:57,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:22:57,252 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:22:57,252 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:22:57,252 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:22:57,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:22:57,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:22:57,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:22:57,348 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:22:57,348 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:22:57,349 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-09-10 10:22:57,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578e07a59/ace8268c0e794f688826ad45da0b7458/FLAGb1f6205b0 [2018-09-10 10:22:58,015 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:22:58,016 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-09-10 10:22:58,033 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578e07a59/ace8268c0e794f688826ad45da0b7458/FLAGb1f6205b0 [2018-09-10 10:22:58,049 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/578e07a59/ace8268c0e794f688826ad45da0b7458 [2018-09-10 10:22:58,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:22:58,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:22:58,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:22:58,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:22:58,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:22:58,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:22:58" (1/1) ... [2018-09-10 10:22:58,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cce367e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:58, skipping insertion in model container [2018-09-10 10:22:58,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:22:58" (1/1) ... [2018-09-10 10:22:58,292 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:22:58,592 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:22:58,621 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:22:58,775 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:22:58,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:58 WrapperNode [2018-09-10 10:22:58,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:22:58,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:22:58,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:22:58,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:22:58,829 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:58" (1/1) ... [2018-09-10 10:22:58,850 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:58" (1/1) ... [2018-09-10 10:22:58,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:22:58,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:22:58,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:22:58,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:22:59,062 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:58" (1/1) ... [2018-09-10 10:22:59,063 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:58" (1/1) ... [2018-09-10 10:22:59,077 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:58" (1/1) ... [2018-09-10 10:22:59,078 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:58" (1/1) ... [2018-09-10 10:22:59,114 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:58" (1/1) ... [2018-09-10 10:22:59,138 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:58" (1/1) ... [2018-09-10 10:22:59,150 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:58" (1/1) ... [2018-09-10 10:22:59,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:22:59,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:22:59,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:22:59,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:22:59,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:58" (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:59,246 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:59,246 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:59,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:22:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:22:59,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:22:59,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:22:59,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:22:59,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:23:02,724 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:23:02,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:02 BoogieIcfgContainer [2018-09-10 10:23:02,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:23:02,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:23:02,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:23:02,730 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:23:02,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:22:58" (1/3) ... [2018-09-10 10:23:02,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c2c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:02, skipping insertion in model container [2018-09-10 10:23:02,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:22:58" (2/3) ... [2018-09-10 10:23:02,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c2c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:02, skipping insertion in model container [2018-09-10 10:23:02,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:02" (3/3) ... [2018-09-10 10:23:02,734 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label48_true-unreach-call_false-termination.c [2018-09-10 10:23:02,745 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:23:02,757 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:23:02,814 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:23:02,815 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:23:02,815 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:23:02,816 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:23:02,816 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:23:02,816 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:23:02,819 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:23:02,819 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:23:02,819 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:23:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-10 10:23:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-10 10:23:02,870 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:02,872 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:02,874 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:02,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1715588104, now seen corresponding path program 1 times [2018-09-10 10:23:02,884 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:02,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:02,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:02,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:02,936 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:03,548 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-09-10 10:23:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:03,889 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:03,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 10:23:03,890 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:03,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:23:03,910 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:23:03,911 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:23:03,913 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 4 states. [2018-09-10 10:23:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:06,564 INFO L93 Difference]: Finished difference Result 788 states and 1373 transitions. [2018-09-10 10:23:06,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:06,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-09-10 10:23:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:06,589 INFO L225 Difference]: With dead ends: 788 [2018-09-10 10:23:06,589 INFO L226 Difference]: Without dead ends: 545 [2018-09-10 10:23:06,597 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:23:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-09-10 10:23:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 383. [2018-09-10 10:23:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-10 10:23:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 631 transitions. [2018-09-10 10:23:06,678 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 631 transitions. Word has length 144 [2018-09-10 10:23:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:06,681 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 631 transitions. [2018-09-10 10:23:06,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:23:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 631 transitions. [2018-09-10 10:23:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-10 10:23:06,688 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:06,689 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,689 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:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1109681091, now seen corresponding path program 1 times [2018-09-10 10:23:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:06,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:06,691 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:07,054 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:07,055 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:07,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:23:07,055 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:07,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:07,057 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:07,058 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:07,058 INFO L87 Difference]: Start difference. First operand 383 states and 631 transitions. Second operand 5 states. [2018-09-10 10:23:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:08,347 INFO L93 Difference]: Finished difference Result 905 states and 1543 transitions. [2018-09-10 10:23:08,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:08,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2018-09-10 10:23:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:08,355 INFO L225 Difference]: With dead ends: 905 [2018-09-10 10:23:08,355 INFO L226 Difference]: Without dead ends: 382 [2018-09-10 10:23:08,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-10 10:23:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-10 10:23:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-10 10:23:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 625 transitions. [2018-09-10 10:23:08,419 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 625 transitions. Word has length 153 [2018-09-10 10:23:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:08,419 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 625 transitions. [2018-09-10 10:23:08,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 625 transitions. [2018-09-10 10:23:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-10 10:23:08,423 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:08,424 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:08,424 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:08,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1590725715, now seen corresponding path program 1 times [2018-09-10 10:23:08,426 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:08,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:08,427 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:08,650 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:08,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:23:08,651 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:08,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:23:08,652 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:23:08,652 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:23:08,652 INFO L87 Difference]: Start difference. First operand 382 states and 625 transitions. Second operand 6 states. [2018-09-10 10:23:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:11,115 INFO L93 Difference]: Finished difference Result 1189 states and 2035 transitions. [2018-09-10 10:23:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:23:11,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-09-10 10:23:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:11,126 INFO L225 Difference]: With dead ends: 1189 [2018-09-10 10:23:11,126 INFO L226 Difference]: Without dead ends: 813 [2018-09-10 10:23:11,128 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:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-09-10 10:23:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 800. [2018-09-10 10:23:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-09-10 10:23:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1266 transitions. [2018-09-10 10:23:11,170 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1266 transitions. Word has length 165 [2018-09-10 10:23:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:11,170 INFO L480 AbstractCegarLoop]: Abstraction has 800 states and 1266 transitions. [2018-09-10 10:23:11,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:23:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1266 transitions. [2018-09-10 10:23:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-10 10:23:11,175 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:11,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,176 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:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2033103620, now seen corresponding path program 1 times [2018-09-10 10:23:11,176 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:11,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:11,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:11,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:11,178 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:11,636 WARN L175 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 10:23:11,890 WARN L175 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-10 10:23:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:11,981 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:11,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:23:11,981 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:11,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:11,982 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:11,982 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:11,982 INFO L87 Difference]: Start difference. First operand 800 states and 1266 transitions. Second operand 5 states. [2018-09-10 10:23:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:14,122 INFO L93 Difference]: Finished difference Result 1711 states and 2740 transitions. [2018-09-10 10:23:14,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:14,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-09-10 10:23:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:14,133 INFO L225 Difference]: With dead ends: 1711 [2018-09-10 10:23:14,134 INFO L226 Difference]: Without dead ends: 769 [2018-09-10 10:23:14,137 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-09-10 10:23:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2018-09-10 10:23:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-09-10 10:23:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1218 transitions. [2018-09-10 10:23:14,164 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1218 transitions. Word has length 169 [2018-09-10 10:23:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:14,164 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1218 transitions. [2018-09-10 10:23:14,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1218 transitions. [2018-09-10 10:23:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-10 10:23:14,169 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:14,169 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,169 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:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1958966728, now seen corresponding path program 1 times [2018-09-10 10:23:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:14,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:14,171 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:14,469 WARN L175 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-10 10:23:14,576 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:14,576 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:14,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:23:14,577 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:14,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:14,577 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:14,577 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:14,578 INFO L87 Difference]: Start difference. First operand 769 states and 1218 transitions. Second operand 5 states. [2018-09-10 10:23:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:15,580 INFO L93 Difference]: Finished difference Result 1679 states and 2699 transitions. [2018-09-10 10:23:15,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:15,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2018-09-10 10:23:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:15,589 INFO L225 Difference]: With dead ends: 1679 [2018-09-10 10:23:15,590 INFO L226 Difference]: Without dead ends: 768 [2018-09-10 10:23:15,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:23:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-09-10 10:23:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2018-09-10 10:23:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-09-10 10:23:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1199 transitions. [2018-09-10 10:23:15,624 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1199 transitions. Word has length 171 [2018-09-10 10:23:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:15,624 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 1199 transitions. [2018-09-10 10:23:15,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1199 transitions. [2018-09-10 10:23:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-10 10:23:15,629 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:15,629 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,630 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:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1616428780, now seen corresponding path program 1 times [2018-09-10 10:23:15,630 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:15,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:15,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:15,632 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:15,867 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:15,867 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:15,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:15,876 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:16,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:16,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:16,684 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:23:16,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2018-09-10 10:23:16,684 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:16,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:16,685 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:16,685 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:23:16,686 INFO L87 Difference]: Start difference. First operand 768 states and 1199 transitions. Second operand 5 states. [2018-09-10 10:23:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:19,072 INFO L93 Difference]: Finished difference Result 2286 states and 3598 transitions. [2018-09-10 10:23:19,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:23:19,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2018-09-10 10:23:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:19,086 INFO L225 Difference]: With dead ends: 2286 [2018-09-10 10:23:19,087 INFO L226 Difference]: Without dead ends: 1524 [2018-09-10 10:23:19,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 342 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:23:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2018-09-10 10:23:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1302. [2018-09-10 10:23:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2018-09-10 10:23:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1895 transitions. [2018-09-10 10:23:19,134 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1895 transitions. Word has length 175 [2018-09-10 10:23:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:19,134 INFO L480 AbstractCegarLoop]: Abstraction has 1302 states and 1895 transitions. [2018-09-10 10:23:19,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1895 transitions. [2018-09-10 10:23:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-10 10:23:19,140 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:19,141 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,141 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:19,141 INFO L82 PathProgramCache]: Analyzing trace with hash 355566067, now seen corresponding path program 1 times [2018-09-10 10:23:19,141 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:19,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:19,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:19,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:19,143 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-10 10:23:19,414 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:19,414 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:19,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:19,424 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:19,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-10 10:23:19,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 47 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:23:19,764 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:19,764 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:19,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:19,781 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:19,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-10 10:23:20,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 47 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:23:20,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:20,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 14 [2018-09-10 10:23:20,202 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:20,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-10 10:23:20,203 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-10 10:23:20,203 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:23:20,205 INFO L87 Difference]: Start difference. First operand 1302 states and 1895 transitions. Second operand 11 states. [2018-09-10 10:23:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:24,354 INFO L93 Difference]: Finished difference Result 4140 states and 6401 transitions. [2018-09-10 10:23:24,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-10 10:23:24,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-09-10 10:23:24,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:24,371 INFO L225 Difference]: With dead ends: 4140 [2018-09-10 10:23:24,371 INFO L226 Difference]: Without dead ends: 2844 [2018-09-10 10:23:24,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 755 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-09-10 10:23:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2018-09-10 10:23:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2522. [2018-09-10 10:23:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2018-09-10 10:23:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 3272 transitions. [2018-09-10 10:23:24,465 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 3272 transitions. Word has length 189 [2018-09-10 10:23:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:24,465 INFO L480 AbstractCegarLoop]: Abstraction has 2522 states and 3272 transitions. [2018-09-10 10:23:24,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-10 10:23:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 3272 transitions. [2018-09-10 10:23:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-10 10:23:24,476 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:24,477 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,477 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:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash 547910264, now seen corresponding path program 1 times [2018-09-10 10:23:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:24,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:24,479 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-10 10:23:24,754 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:24,754 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:24,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:24,761 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:24,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-10 10:23:25,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-10 10:23:25,255 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:23:25,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-09-10 10:23:25,255 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:25,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:25,256 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:25,256 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:23:25,257 INFO L87 Difference]: Start difference. First operand 2522 states and 3272 transitions. Second operand 3 states. [2018-09-10 10:23:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:26,011 INFO L93 Difference]: Finished difference Result 5479 states and 7247 transitions. [2018-09-10 10:23:26,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:26,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-09-10 10:23:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:26,025 INFO L225 Difference]: With dead ends: 5479 [2018-09-10 10:23:26,026 INFO L226 Difference]: Without dead ends: 2963 [2018-09-10 10:23:26,034 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:23:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2018-09-10 10:23:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2960. [2018-09-10 10:23:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2018-09-10 10:23:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3757 transitions. [2018-09-10 10:23:26,107 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3757 transitions. Word has length 208 [2018-09-10 10:23:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:26,108 INFO L480 AbstractCegarLoop]: Abstraction has 2960 states and 3757 transitions. [2018-09-10 10:23:26,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3757 transitions. [2018-09-10 10:23:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-10 10:23:26,120 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:26,120 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:26,121 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:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1110631700, now seen corresponding path program 1 times [2018-09-10 10:23:26,121 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:26,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:26,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:26,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:26,123 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:26,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:26,326 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:26,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:26,334 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:26,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:26,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:26,816 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:23:26,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:23:26,816 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:26,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:26,817 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:26,817 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:26,818 INFO L87 Difference]: Start difference. First operand 2960 states and 3757 transitions. Second operand 3 states. [2018-09-10 10:23:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:27,742 INFO L93 Difference]: Finished difference Result 5917 states and 7525 transitions. [2018-09-10 10:23:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:27,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-09-10 10:23:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:27,753 INFO L225 Difference]: With dead ends: 5917 [2018-09-10 10:23:27,754 INFO L226 Difference]: Without dead ends: 2963 [2018-09-10 10:23:27,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 448 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2018-09-10 10:23:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2941. [2018-09-10 10:23:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2941 states. [2018-09-10 10:23:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 3651 transitions. [2018-09-10 10:23:27,832 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 3651 transitions. Word has length 225 [2018-09-10 10:23:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:27,833 INFO L480 AbstractCegarLoop]: Abstraction has 2941 states and 3651 transitions. [2018-09-10 10:23:27,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 3651 transitions. [2018-09-10 10:23:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-10 10:23:27,846 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:27,847 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:27,847 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:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash 237604951, now seen corresponding path program 1 times [2018-09-10 10:23:27,847 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:27,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:27,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:27,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:27,849 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 144 proven. 16 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-09-10 10:23:28,316 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:28,316 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:28,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:28,325 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:28,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-10 10:23:29,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-10 10:23:29,941 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:23:29,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2018-09-10 10:23:29,941 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:29,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:29,942 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:29,942 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:23:29,942 INFO L87 Difference]: Start difference. First operand 2941 states and 3651 transitions. Second operand 5 states. [2018-09-10 10:23:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:31,483 INFO L93 Difference]: Finished difference Result 8656 states and 10871 transitions. [2018-09-10 10:23:31,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:23:31,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286 [2018-09-10 10:23:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:31,514 INFO L225 Difference]: With dead ends: 8656 [2018-09-10 10:23:31,514 INFO L226 Difference]: Without dead ends: 5721 [2018-09-10 10:23:31,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 560 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:23:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2018-09-10 10:23:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 4847. [2018-09-10 10:23:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4847 states. [2018-09-10 10:23:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 5950 transitions. [2018-09-10 10:23:31,662 INFO L78 Accepts]: Start accepts. Automaton has 4847 states and 5950 transitions. Word has length 286 [2018-09-10 10:23:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:31,663 INFO L480 AbstractCegarLoop]: Abstraction has 4847 states and 5950 transitions. [2018-09-10 10:23:31,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4847 states and 5950 transitions. [2018-09-10 10:23:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-10 10:23:31,684 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:31,684 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:31,684 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__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:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash 963960424, now seen corresponding path program 1 times [2018-09-10 10:23:31,685 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:31,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:31,686 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 160 proven. 51 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-10 10:23:32,198 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:32,198 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:32,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:32,214 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:32,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 159 proven. 2 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-09-10 10:23:32,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 174 proven. 16 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-10 10:23:33,164 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:33,164 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:33,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:33,180 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:33,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 159 proven. 2 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-09-10 10:23:33,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 174 proven. 16 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-10 10:23:33,796 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:33,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 17 [2018-09-10 10:23:33,797 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:33,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:23:33,798 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:23:33,798 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:23:33,798 INFO L87 Difference]: Start difference. First operand 4847 states and 5950 transitions. Second operand 9 states. [2018-09-10 10:23:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:40,468 INFO L93 Difference]: Finished difference Result 18561 states and 24671 transitions. [2018-09-10 10:23:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-10 10:23:40,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 296 [2018-09-10 10:23:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:40,552 INFO L225 Difference]: With dead ends: 18561 [2018-09-10 10:23:40,552 INFO L226 Difference]: Without dead ends: 13720 [2018-09-10 10:23:40,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 1193 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640 [2018-09-10 10:23:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13720 states. [2018-09-10 10:23:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13720 to 12733. [2018-09-10 10:23:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12733 states. [2018-09-10 10:23:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12733 states to 12733 states and 15105 transitions. [2018-09-10 10:23:41,013 INFO L78 Accepts]: Start accepts. Automaton has 12733 states and 15105 transitions. Word has length 296 [2018-09-10 10:23:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:41,014 INFO L480 AbstractCegarLoop]: Abstraction has 12733 states and 15105 transitions. [2018-09-10 10:23:41,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:23:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 12733 states and 15105 transitions. [2018-09-10 10:23:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-10 10:23:41,067 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:41,067 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 10:23:41,067 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__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:41,068 INFO L82 PathProgramCache]: Analyzing trace with hash -816923189, now seen corresponding path program 1 times [2018-09-10 10:23:41,068 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:41,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:41,069 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 159 proven. 68 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-10 10:23:41,675 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:41,675 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:41,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:41,685 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:41,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 226 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:41,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 226 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:42,050 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:42,050 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:42,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:42,065 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:42,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 226 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:42,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 226 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-10 10:23:42,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:23:42,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 16 [2018-09-10 10:23:42,645 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:23:42,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:23:42,646 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:23:42,647 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:23:42,647 INFO L87 Difference]: Start difference. First operand 12733 states and 15105 transitions. Second operand 9 states. [2018-09-10 10:23:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:45,641 INFO L93 Difference]: Finished difference Result 24220 states and 28906 transitions. [2018-09-10 10:23:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-10 10:23:45,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 303 [2018-09-10 10:23:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:45,662 INFO L225 Difference]: With dead ends: 24220 [2018-09-10 10:23:45,662 INFO L226 Difference]: Without dead ends: 7236 [2018-09-10 10:23:45,692 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1220 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-09-10 10:23:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2018-09-10 10:23:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 6295. [2018-09-10 10:23:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6295 states. [2018-09-10 10:23:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6295 states to 6295 states and 6789 transitions. [2018-09-10 10:23:45,847 INFO L78 Accepts]: Start accepts. Automaton has 6295 states and 6789 transitions. Word has length 303 [2018-09-10 10:23:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:45,848 INFO L480 AbstractCegarLoop]: Abstraction has 6295 states and 6789 transitions. [2018-09-10 10:23:45,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:23:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6295 states and 6789 transitions. [2018-09-10 10:23:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-10 10:23:45,871 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:45,871 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,872 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__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:45,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1189056931, now seen corresponding path program 1 times [2018-09-10 10:23:45,872 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:45,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:45,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:45,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:45,874 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:46,177 WARN L175 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:23:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 221 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:46,478 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:46,478 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:46,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:46,487 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:46,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:23:46,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:23:47,187 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:47,188 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:23:47,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:47,203 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:47,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 153 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-10 10:23:47,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-10 10:23:47,952 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 10:23:47,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5, 5, 5] total 18 [2018-09-10 10:23:47,952 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:47,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:47,953 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:47,953 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:23:47,953 INFO L87 Difference]: Start difference. First operand 6295 states and 6789 transitions. Second operand 5 states. [2018-09-10 10:23:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:48,611 INFO L93 Difference]: Finished difference Result 11094 states and 11994 transitions. [2018-09-10 10:23:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:48,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2018-09-10 10:23:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:48,611 INFO L225 Difference]: With dead ends: 11094 [2018-09-10 10:23:48,612 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:23:48,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1213 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:23:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:23:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:23:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:23:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:23:48,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 306 [2018-09-10 10:23:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:48,628 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:23:48,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:23:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:23:48,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:23:48,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:23:48,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:48,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,373 WARN L175 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 217 [2018-09-10 10:23:49,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 10:23:49,884 WARN L175 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 217 [2018-09-10 10:23:50,291 WARN L175 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-09-10 10:23:51,000 WARN L175 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-09-10 10:23:51,206 WARN L175 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-09-10 10:23:55,977 WARN L175 SmtUtils]: Spent 4.76 s on a formula simplification. DAG size of input: 253 DAG size of output: 91 [2018-09-10 10:23:57,485 WARN L175 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 205 DAG size of output: 78 [2018-09-10 10:23:58,991 WARN L175 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 205 DAG size of output: 78 [2018-09-10 10:23:58,995 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,995 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,995 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,995 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,995 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,995 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:23:58,996 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-10 10:23:58,997 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,998 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,999 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,999 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,999 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:58,999 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:23:58,999 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-10 10:23:58,999 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-10 10:23:58,999 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:58,999 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-10 10:23:58,999 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-10 10:23:59,000 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-10 10:23:59,000 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-10 10:23:59,000 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-10 10:23:59,000 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:59,000 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-10 10:23:59,000 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-10 10:23:59,000 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-10 10:23:59,000 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,000 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,001 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,001 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,001 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,001 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-10 10:23:59,001 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-10 10:23:59,001 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-10 10:23:59,001 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-10 10:23:59,001 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-10 10:23:59,001 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-10 10:23:59,002 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-10 10:23:59,002 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-10 10:23:59,002 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-10 10:23:59,002 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-10 10:23:59,002 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-10 10:23:59,002 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-10 10:23:59,002 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-10 10:23:59,002 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,002 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,003 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,003 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,003 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,003 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-10 10:23:59,003 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-10 10:23:59,003 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-10 10:23:59,003 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-10 10:23:59,003 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-10 10:23:59,004 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-10 10:23:59,004 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-10 10:23:59,004 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-10 10:23:59,004 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-10 10:23:59,004 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-10 10:23:59,004 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-10 10:23:59,004 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-10 10:23:59,004 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-10 10:23:59,004 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:23:59,005 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,006 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:23:59,006 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-10 10:23:59,006 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-10 10:23:59,006 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 583) no Hoare annotation was computed. [2018-09-10 10:23:59,006 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-10 10:23:59,006 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-10 10:23:59,006 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-10 10:23:59,006 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-10 10:23:59,006 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,007 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-10 10:23:59,008 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,009 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-10 10:23:59,010 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-10 10:23:59,010 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-10 10:23:59,010 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-10 10:23:59,010 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-10 10:23:59,010 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-10 10:23:59,010 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-10 10:23:59,010 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-10 10:23:59,010 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-10 10:23:59,010 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-10 10:23:59,011 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-10 10:23:59,011 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-10 10:23:59,011 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-10 10:23:59,011 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-10 10:23:59,011 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,011 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,011 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,011 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,011 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,012 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,012 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-10 10:23:59,012 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-10 10:23:59,012 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-10 10:23:59,012 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-10 10:23:59,012 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-10 10:23:59,012 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-10 10:23:59,012 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-10 10:23:59,012 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-10 10:23:59,013 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-10 10:23:59,013 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-10 10:23:59,013 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-10 10:23:59,013 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-10 10:23:59,013 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-10 10:23:59,013 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,013 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,013 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,013 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-10 10:23:59,014 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,015 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,016 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,016 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,016 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-10 10:23:59,016 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-10 10:23:59,016 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-10 10:23:59,016 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-10 10:23:59,016 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-10 10:23:59,016 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-10 10:23:59,017 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 ((.cse26 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0))) (.cse9 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) (.cse22 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse23 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|)) (.cse21 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse24 (= ~__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)|)) (.cse25 (= ~__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__a25~0)|))) (let ((.cse13 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse15 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse16 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse17 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (.cse18 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10)) (.cse10 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10)) (.cse1 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9)) (.cse5 (and .cse22 .cse23 .cse21 .cse24 .cse25)) (.cse6 (< 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|)) (.cse12 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|)) (.cse2 (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|)) (.cse27 (and .cse23 .cse21 .cse24 .cse25)) (.cse8 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|)) (.cse7 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7)) (.cse14 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse19 (not .cse9)) (.cse20 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|)) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse3 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1))) (.cse4 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1))) (.cse11 (and .cse23 .cse26 .cse21 .cse24 .cse25))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse5 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8) (or .cse0 .cse3 .cse9 .cse4 .cse10 .cse11 .cse6) (or .cse0 .cse12 .cse11 .cse9 .cse4 .cse10) (or (and .cse13 .cse14 .cse15 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse16) .cse0 .cse17 .cse3 (not .cse18) .cse4 .cse19) (or .cse0 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) (and .cse13 .cse14 .cse15 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse16) .cse17 .cse3 .cse4 .cse19) (or .cse0 .cse12 .cse5 .cse1 .cse18 .cse4 .cse6 .cse7) (or (or .cse20 .cse0 .cse12) .cse1 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (and .cse21 .cse22 .cse23 .cse24 .cse25) .cse4) (or .cse0 (and .cse22 .cse23 .cse26 .cse21 .cse24 .cse25) .cse1 .cse3 .cse18 .cse9 .cse4) (or .cse0 .cse26 .cse12 .cse1 .cse9 .cse4 .cse7) (or .cse27 .cse0 .cse2 .cse3 .cse8) (or .cse0 .cse12 .cse4 .cse10 .cse6 .cse27) (or .cse0 .cse12 .cse1 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse12 .cse2 .cse27 .cse8) (or (not .cse7) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse14) .cse0 .cse3 .cse4 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7)) .cse19) (or .cse20 .cse0 .cse3 .cse9 .cse4 .cse11)))) [2018-09-10 10:23:59,017 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-10 10:23:59,017 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-10 10:23:59,017 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-10 10:23:59,017 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-10 10:23:59,017 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-10 10:23:59,018 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:23:59,019 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9)) (= ~__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)|) (= ~__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__a25~0)|)) [2018-09-10 10:23:59,019 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:23:59,019 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:23:59,019 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__a17~0 9)) (<= ~__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__a25~0 0) (= 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) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 0)) [2018-09-10 10:23:59,019 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:23:59,019 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:23:59,019 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)) (< 0 |old(~__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)| 9) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)|) (= ~__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__a25~0)|)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1))) [2018-09-10 10:23:59,019 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-10 10:23:59,020 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0))) (let ((.cse10 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 0)) (.cse1 (or (not .cse12) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~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)|)) (.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (let ((.cse5 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse7 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse11 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse8 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 8)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse14 (or (and .cse6 .cse1 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7) .cse13) (and .cse10 .cse6 .cse1 .cse3 .cse13)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse3 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse4) (and .cse0 (and .cse9 .cse5 .cse6 .cse3)) (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 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse12 .cse2 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) (and .cse5 .cse0 .cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) .cse3 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse5 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse1 .cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7)) (not .cse13) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse12 .cse2 .cse4) (and .cse9 .cse8 .cse6 .cse3) (and .cse11 .cse12 .cse2 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) (and .cse9 .cse14) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse9 .cse8 .cse2 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (and .cse0 (and .cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 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)|) (= ~__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__a25~0)|)))))) [2018-09-10 10:23:59,020 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:23:59,020 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-10 10:23:59,020 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse12 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0))) (let ((.cse10 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 0)) (.cse1 (or (not .cse12) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~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)|)) (.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (let ((.cse5 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse7 (<= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse11 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse9 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0)) (.cse8 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 8)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse14 (or (and .cse6 .cse1 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7) .cse13) (and .cse10 .cse6 .cse1 .cse3 .cse13)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse3 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse4) (and .cse0 (and .cse9 .cse5 .cse6 .cse3)) (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 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse12 .cse2 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) (and .cse5 .cse0 .cse6 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) .cse3 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse5 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse1 .cse4 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7)) (not .cse13) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)|) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse12 .cse2 .cse4) (and .cse9 .cse8 .cse6 .cse3) (and .cse11 .cse12 .cse2 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) (and .cse9 .cse14) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse9 .cse8 .cse2 .cse3) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (and .cse0 (and .cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 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)|) (= ~__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__a25~0)|)))))) [2018-09-10 10:23:59,021 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-10 10:23:59,021 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-10 10:23:59,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:23:59 BoogieIcfgContainer [2018-09-10 10:23:59,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:23:59,053 INFO L168 Benchmark]: Toolchain (without parser) took 60990.63 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -843.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-10 10:23:59,054 INFO L168 Benchmark]: CDTParser took 0.21 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:59,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.40 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:59,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.75 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:59,056 INFO L168 Benchmark]: Boogie Preprocessor took 241.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:59,057 INFO L168 Benchmark]: RCFGBuilder took 3561.69 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: 122.5 MB). Peak memory consumption was 122.5 MB. Max. memory is 7.1 GB. [2018-09-10 10:23:59,057 INFO L168 Benchmark]: TraceAbstraction took 56326.24 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 782.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -165.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-10 10:23:59,062 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.40 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 101.75 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 241.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3561.69 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: 122.5 MB). Peak memory consumption was 122.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56326.24 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 782.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -165.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 583]: 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__a17 == 9) && (!(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19))) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 10 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 <= 0) && 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && ((__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__a28 <= 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 <= 0) && 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__a19) == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 7 && (!(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19))) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((8 == __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) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 10 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9)) && __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__a28 == 7)) && 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 10 && 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && (!(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19))) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 10) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 7 == \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__a25 <= 0 && 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && (!(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19))) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) && \old(__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__a21 == 1)) || 0 < \old(__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__a11)) || ((((7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 <= 0) && 7 == \old(__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 && 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) && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0 && (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 <= 0 && (!(1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == __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__a28) == __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) <= 7) && __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__a28 <= 7 && __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__a11) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19))) && 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)))) || 7 < \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__a19 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 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__a17) == 9) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && (((((__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__a11) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == __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__a28) == __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) <= 7) && __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__a28 <= 7 && __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__a11) || !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19))) && 7 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) && __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__a11 <= 0) && __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)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 56.2s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 10.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1718 SDtfs, 11621 SDslu, 2246 SDs, 0 SdLazy, 17146 SolverSat, 2957 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6355 GetRequests, 6160 SyntacticMatches, 34 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12733occurred in iteration=11, 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 3546 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 287 PreInvPairs, 411 NumberOfFragments, 1454 HoareAnnotationTreeSize, 287 FomulaSimplifications, 56969 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16178 FormulaSimplificationTreeSizeReductionInter, 9.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 5872 NumberOfCodeBlocks, 5872 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 8917 ConstructedInterpolants, 0 QuantifiedInterpolants, 5332013 SizeOfPredicates, 15 NumberOfNonLiveVariables, 6771 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 37 InterpolantComputations, 14 PerfectInterpolantSequences, 5273/5543 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_label48_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-23-59-087.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label48_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-23-59-087.csv Received shutdown request...