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/Problem10_label18_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 11:31:30,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 11:31:30,226 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 11:31:30,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 11:31:30,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 11:31:30,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 11:31:30,242 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 11:31:30,244 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 11:31:30,245 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 11:31:30,246 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 11:31:30,247 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 11:31:30,247 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 11:31:30,248 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 11:31:30,249 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 11:31:30,250 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 11:31:30,251 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 11:31:30,252 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 11:31:30,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 11:31:30,259 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 11:31:30,261 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 11:31:30,263 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 11:31:30,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 11:31:30,269 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 11:31:30,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 11:31:30,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 11:31:30,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 11:31:30,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 11:31:30,273 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 11:31:30,274 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 11:31:30,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 11:31:30,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 11:31:30,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 11:31:30,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 11:31:30,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 11:31:30,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 11:31:30,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 11:31:30,281 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 11:31:30,311 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 11:31:30,312 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 11:31:30,314 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 11:31:30,314 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 11:31:30,314 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 11:31:30,314 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 11:31:30,314 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 11:31:30,315 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 11:31:30,315 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 11:31:30,315 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 11:31:30,315 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 11:31:30,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 11:31:30,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 11:31:30,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 11:31:30,316 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 11:31:30,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 11:31:30,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 11:31:30,317 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 11:31:30,317 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 11:31:30,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 11:31:30,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 11:31:30,318 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 11:31:30,318 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 11:31:30,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 11:31:30,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 11:31:30,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 11:31:30,319 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 11:31:30,319 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 11:31:30,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 11:31:30,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 11:31:30,320 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 11:31:30,320 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 11:31:30,320 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 11:31:30,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 11:31:30,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 11:31:30,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 11:31:30,406 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 11:31:30,407 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 11:31:30,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label18_true-unreach-call.c [2018-09-10 11:31:30,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea276447/3f8575efa351461788f143f216a730d4/FLAGcc2064b27 [2018-09-10 11:31:31,095 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 11:31:31,098 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label18_true-unreach-call.c [2018-09-10 11:31:31,117 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea276447/3f8575efa351461788f143f216a730d4/FLAGcc2064b27 [2018-09-10 11:31:31,133 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea276447/3f8575efa351461788f143f216a730d4 [2018-09-10 11:31:31,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 11:31:31,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 11:31:31,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 11:31:31,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 11:31:31,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 11:31:31,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:31,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6b69f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31, skipping insertion in model container [2018-09-10 11:31:31,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:31,348 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 11:31:31,637 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:31:31,655 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 11:31:31,776 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 11:31:31,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31 WrapperNode [2018-09-10 11:31:31,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 11:31:31,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 11:31:31,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 11:31:31,827 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 11:31:31,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:31,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:31,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 11:31:31,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 11:31:31,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 11:31:31,950 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 11:31:32,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:32,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:32,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:32,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:32,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:32,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:32,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (1/1) ... [2018-09-10 11:31:32,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 11:31:32,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 11:31:32,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 11:31:32,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 11:31:32,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (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 11:31:32,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 11:31:32,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 11:31:32,277 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:31:32,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 11:31:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 11:31:32,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 11:31:32,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 11:31:32,278 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 11:31:35,509 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 11:31:35,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:31:35 BoogieIcfgContainer [2018-09-10 11:31:35,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 11:31:35,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 11:31:35,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 11:31:35,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 11:31:35,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:31:31" (1/3) ... [2018-09-10 11:31:35,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:31:35, skipping insertion in model container [2018-09-10 11:31:35,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:31:31" (2/3) ... [2018-09-10 11:31:35,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:31:35, skipping insertion in model container [2018-09-10 11:31:35,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:31:35" (3/3) ... [2018-09-10 11:31:35,520 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label18_true-unreach-call.c [2018-09-10 11:31:35,532 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 11:31:35,542 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 11:31:35,602 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 11:31:35,603 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 11:31:35,603 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 11:31:35,603 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 11:31:35,603 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 11:31:35,604 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 11:31:35,604 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 11:31:35,604 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 11:31:35,604 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 11:31:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-10 11:31:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-10 11:31:35,643 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:35,645 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] [2018-09-10 11:31:35,646 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1094917127, now seen corresponding path program 1 times [2018-09-10 11:31:35,656 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:35,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:35,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:35,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:35,721 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:36,132 WARN L175 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 11:31:36,243 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 11:31:36,248 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:31:36,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 11:31:36,249 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:36,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 11:31:36,273 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 11:31:36,274 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:31:36,276 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-09-10 11:31:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:38,315 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-09-10 11:31:38,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 11:31:38,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-10 11:31:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:38,345 INFO L225 Difference]: With dead ends: 574 [2018-09-10 11:31:38,345 INFO L226 Difference]: Without dead ends: 356 [2018-09-10 11:31:38,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 11:31:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-09-10 11:31:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-09-10 11:31:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-10 11:31:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-09-10 11:31:38,479 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 65 [2018-09-10 11:31:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:38,480 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-09-10 11:31:38,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 11:31:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-09-10 11:31:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-10 11:31:38,491 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:38,492 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:38,492 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2054021900, now seen corresponding path program 1 times [2018-09-10 11:31:38,493 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:38,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:38,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:38,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:38,495 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:38,927 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:31:38,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:31:38,927 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:38,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:31:38,930 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:31:38,930 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:31:38,930 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 4 states. [2018-09-10 11:31:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:40,907 INFO L93 Difference]: Finished difference Result 1282 states and 2328 transitions. [2018-09-10 11:31:40,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:31:40,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-09-10 11:31:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:40,931 INFO L225 Difference]: With dead ends: 1282 [2018-09-10 11:31:40,931 INFO L226 Difference]: Without dead ends: 932 [2018-09-10 11:31:40,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:31:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2018-09-10 11:31:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2018-09-10 11:31:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-09-10 11:31:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1471 transitions. [2018-09-10 11:31:41,013 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1471 transitions. Word has length 185 [2018-09-10 11:31:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:41,014 INFO L480 AbstractCegarLoop]: Abstraction has 932 states and 1471 transitions. [2018-09-10 11:31:41,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:31:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1471 transitions. [2018-09-10 11:31:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-10 11:31:41,027 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:41,027 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:41,027 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:41,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2121917984, now seen corresponding path program 1 times [2018-09-10 11:31:41,028 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:41,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:41,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:41,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:41,030 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 11:31:41,382 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:31:41,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 11:31:41,383 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:41,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 11:31:41,384 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 11:31:41,384 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 11:31:41,384 INFO L87 Difference]: Start difference. First operand 932 states and 1471 transitions. Second operand 6 states. [2018-09-10 11:31:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:44,726 INFO L93 Difference]: Finished difference Result 2035 states and 3273 transitions. [2018-09-10 11:31:44,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 11:31:44,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2018-09-10 11:31:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:44,744 INFO L225 Difference]: With dead ends: 2035 [2018-09-10 11:31:44,744 INFO L226 Difference]: Without dead ends: 1109 [2018-09-10 11:31:44,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 11:31:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2018-09-10 11:31:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1090. [2018-09-10 11:31:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-09-10 11:31:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1636 transitions. [2018-09-10 11:31:44,803 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1636 transitions. Word has length 191 [2018-09-10 11:31:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:44,804 INFO L480 AbstractCegarLoop]: Abstraction has 1090 states and 1636 transitions. [2018-09-10 11:31:44,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 11:31:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1636 transitions. [2018-09-10 11:31:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-10 11:31:44,812 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:44,812 INFO L376 BasicCegarLoop]: trace histogram [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, 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] [2018-09-10 11:31:44,813 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:44,813 INFO L82 PathProgramCache]: Analyzing trace with hash -411541578, now seen corresponding path program 1 times [2018-09-10 11:31:44,813 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:44,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:44,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:44,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:44,815 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 116 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:31:45,075 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:31:45,075 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 11:31:45,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:45,085 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:31:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:45,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:31:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-10 11:31:45,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:31:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 116 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 11:31:46,076 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 11:31:46,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2018-09-10 11:31:46,077 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:31:46,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 11:31:46,078 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 11:31:46,078 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-10 11:31:46,079 INFO L87 Difference]: Start difference. First operand 1090 states and 1636 transitions. Second operand 5 states. [2018-09-10 11:31:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:49,820 INFO L93 Difference]: Finished difference Result 3399 states and 5248 transitions. [2018-09-10 11:31:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 11:31:49,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-09-10 11:31:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:49,840 INFO L225 Difference]: With dead ends: 3399 [2018-09-10 11:31:49,840 INFO L226 Difference]: Without dead ends: 2315 [2018-09-10 11:31:49,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 523 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-10 11:31:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2018-09-10 11:31:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2298. [2018-09-10 11:31:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2298 states. [2018-09-10 11:31:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 3278 transitions. [2018-09-10 11:31:49,936 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 3278 transitions. Word has length 264 [2018-09-10 11:31:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:49,937 INFO L480 AbstractCegarLoop]: Abstraction has 2298 states and 3278 transitions. [2018-09-10 11:31:49,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 11:31:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 3278 transitions. [2018-09-10 11:31:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-09-10 11:31:49,951 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:49,951 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 11:31:49,952 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:49,952 INFO L82 PathProgramCache]: Analyzing trace with hash -286370428, now seen corresponding path program 1 times [2018-09-10 11:31:49,952 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:49,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:49,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:49,955 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 11:31:50,371 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:31:50,371 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 11:31:50,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:50,380 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:31:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:50,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:31:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 328 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-10 11:31:50,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:31:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 11:31:50,997 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:31:50,997 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 11:31:51,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:51,024 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:31:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:51,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:31:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 328 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-10 11:31:51,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:31:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 11:31:51,845 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:31:51,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 13 [2018-09-10 11:31:51,846 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:31:51,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 11:31:51,847 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 11:31:51,847 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-09-10 11:31:51,847 INFO L87 Difference]: Start difference. First operand 2298 states and 3278 transitions. Second operand 9 states. [2018-09-10 11:31:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:31:56,150 INFO L93 Difference]: Finished difference Result 5627 states and 8210 transitions. [2018-09-10 11:31:56,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-10 11:31:56,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 335 [2018-09-10 11:31:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:31:56,173 INFO L225 Difference]: With dead ends: 5627 [2018-09-10 11:31:56,174 INFO L226 Difference]: Without dead ends: 3335 [2018-09-10 11:31:56,192 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1360 GetRequests, 1337 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-09-10 11:31:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2018-09-10 11:31:56,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3031. [2018-09-10 11:31:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3031 states. [2018-09-10 11:31:56,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 3916 transitions. [2018-09-10 11:31:56,309 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 3916 transitions. Word has length 335 [2018-09-10 11:31:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:31:56,309 INFO L480 AbstractCegarLoop]: Abstraction has 3031 states and 3916 transitions. [2018-09-10 11:31:56,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 11:31:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 3916 transitions. [2018-09-10 11:31:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-10 11:31:56,327 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:31:56,327 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-09-10 11:31:56,328 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:31:56,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1780174805, now seen corresponding path program 1 times [2018-09-10 11:31:56,328 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:31:56,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:56,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:56,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:31:56,329 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:31:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 250 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-10 11:31:57,003 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:31:57,003 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 11:31:57,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:57,012 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:31:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:57,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:31:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 339 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-10 11:31:57,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:31:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 250 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-10 11:31:58,000 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:31:58,001 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:31:58,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:31:58,021 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:31:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:31:58,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:31:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 339 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-10 11:31:58,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:31:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 250 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-10 11:31:58,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:31:58,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5, 5, 5] total 20 [2018-09-10 11:31:58,638 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:31:58,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-10 11:31:58,639 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-10 11:31:58,639 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-09-10 11:31:58,639 INFO L87 Difference]: Start difference. First operand 3031 states and 3916 transitions. Second operand 14 states. [2018-09-10 11:32:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:03,611 INFO L93 Difference]: Finished difference Result 8377 states and 11281 transitions. [2018-09-10 11:32:03,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-10 11:32:03,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 344 [2018-09-10 11:32:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:03,624 INFO L225 Difference]: With dead ends: 8377 [2018-09-10 11:32:03,625 INFO L226 Difference]: Without dead ends: 2218 [2018-09-10 11:32:03,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1416 GetRequests, 1379 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2018-09-10 11:32:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2018-09-10 11:32:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1933. [2018-09-10 11:32:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2018-09-10 11:32:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2276 transitions. [2018-09-10 11:32:03,738 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2276 transitions. Word has length 344 [2018-09-10 11:32:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:03,738 INFO L480 AbstractCegarLoop]: Abstraction has 1933 states and 2276 transitions. [2018-09-10 11:32:03,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-10 11:32:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2276 transitions. [2018-09-10 11:32:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-09-10 11:32:03,751 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:03,751 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:32:03,752 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1508247517, now seen corresponding path program 1 times [2018-09-10 11:32:03,752 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:03,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:03,754 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 364 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-10 11:32:04,552 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:04,552 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 11:32:04,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:04,566 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:04,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 364 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-10 11:32:04,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 364 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-10 11:32:05,549 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 11:32:05,549 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 11:32:05,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:05,586 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 11:32:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:05,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 11:32:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 364 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-10 11:32:05,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 11:32:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 364 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-10 11:32:06,120 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 11:32:06,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 8 [2018-09-10 11:32:06,121 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 11:32:06,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 11:32:06,122 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 11:32:06,122 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-09-10 11:32:06,122 INFO L87 Difference]: Start difference. First operand 1933 states and 2276 transitions. Second operand 7 states. [2018-09-10 11:32:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:09,958 INFO L93 Difference]: Finished difference Result 5546 states and 6893 transitions. [2018-09-10 11:32:09,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-10 11:32:09,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 380 [2018-09-10 11:32:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:09,975 INFO L225 Difference]: With dead ends: 5546 [2018-09-10 11:32:09,975 INFO L226 Difference]: Without dead ends: 3624 [2018-09-10 11:32:09,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1532 GetRequests, 1516 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-10 11:32:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2018-09-10 11:32:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 3165. [2018-09-10 11:32:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3165 states. [2018-09-10 11:32:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 3716 transitions. [2018-09-10 11:32:10,086 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 3716 transitions. Word has length 380 [2018-09-10 11:32:10,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:10,087 INFO L480 AbstractCegarLoop]: Abstraction has 3165 states and 3716 transitions. [2018-09-10 11:32:10,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 11:32:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 3716 transitions. [2018-09-10 11:32:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-09-10 11:32:10,098 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 11:32:10,099 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 11:32:10,099 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 11:32:10,099 INFO L82 PathProgramCache]: Analyzing trace with hash -799298838, now seen corresponding path program 1 times [2018-09-10 11:32:10,099 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 11:32:10,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:10,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 11:32:10,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 11:32:10,101 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 11:32:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 11:32:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-09-10 11:32:10,587 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 11:32:10,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 11:32:10,588 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 11:32:10,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 11:32:10,589 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 11:32:10,589 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:32:10,589 INFO L87 Difference]: Start difference. First operand 3165 states and 3716 transitions. Second operand 4 states. [2018-09-10 11:32:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 11:32:12,541 INFO L93 Difference]: Finished difference Result 7918 states and 9543 transitions. [2018-09-10 11:32:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 11:32:12,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2018-09-10 11:32:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 11:32:12,545 INFO L225 Difference]: With dead ends: 7918 [2018-09-10 11:32:12,545 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 11:32:12,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 11:32:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 11:32:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 11:32:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 11:32:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 11:32:12,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 393 [2018-09-10 11:32:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 11:32:12,568 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 11:32:12,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 11:32:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 11:32:12,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 11:32:12,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 11:32:12,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:12,970 WARN L175 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 144 [2018-09-10 11:32:13,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 11:32:13,222 WARN L175 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 144 [2018-09-10 11:32:13,543 WARN L175 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-09-10 11:32:15,054 WARN L175 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 201 DAG size of output: 52 [2018-09-10 11:32:15,941 WARN L175 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 52 [2018-09-10 11:32:16,683 WARN L175 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 52 [2018-09-10 11:32:16,686 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:32:16,687 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) [2018-09-10 11:32:16,687 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:32:16,687 INFO L426 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-09-10 11:32:16,687 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,687 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,687 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,687 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,687 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,688 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,688 INFO L426 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-09-10 11:32:16,688 INFO L426 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-09-10 11:32:16,688 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 11:32:16,688 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 11:32:16,688 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 11:32:16,688 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 11:32:16,688 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 11:32:16,688 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 11:32:16,689 INFO L426 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-09-10 11:32:16,689 INFO L426 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-09-10 11:32:16,689 INFO L426 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-09-10 11:32:16,689 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,689 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,689 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,689 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,689 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,690 INFO L426 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-09-10 11:32:16,690 INFO L426 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-09-10 11:32:16,690 INFO L426 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-09-10 11:32:16,690 INFO L426 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-09-10 11:32:16,690 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 11:32:16,690 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 11:32:16,690 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 11:32:16,690 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 11:32:16,690 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 11:32:16,691 INFO L426 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-09-10 11:32:16,691 INFO L426 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-09-10 11:32:16,691 INFO L426 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-09-10 11:32:16,691 INFO L426 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-09-10 11:32:16,691 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-09-10 11:32:16,691 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,691 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,691 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,691 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,692 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,692 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,692 INFO L426 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-09-10 11:32:16,692 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 11:32:16,692 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 11:32:16,692 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 11:32:16,692 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 11:32:16,692 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 11:32:16,693 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,693 INFO L426 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-09-10 11:32:16,693 INFO L426 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-09-10 11:32:16,693 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-09-10 11:32:16,693 INFO L426 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-09-10 11:32:16,693 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,693 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,693 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,693 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,694 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,694 INFO L426 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-09-10 11:32:16,694 INFO L426 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-09-10 11:32:16,694 INFO L426 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-09-10 11:32:16,694 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 11:32:16,694 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 11:32:16,694 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 11:32:16,694 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 11:32:16,694 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 11:32:16,695 INFO L426 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-09-10 11:32:16,695 INFO L426 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-09-10 11:32:16,695 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-09-10 11:32:16,695 INFO L426 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-09-10 11:32:16,695 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-09-10 11:32:16,695 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,695 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,695 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,695 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,696 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,696 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 11:32:16,696 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 11:32:16,696 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 11:32:16,696 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 11:32:16,696 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 11:32:16,696 INFO L426 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-09-10 11:32:16,696 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-09-10 11:32:16,697 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-09-10 11:32:16,697 INFO L426 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-09-10 11:32:16,697 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,697 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,697 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,697 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,697 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,697 INFO L426 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-09-10 11:32:16,697 INFO L426 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-09-10 11:32:16,698 INFO L426 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-09-10 11:32:16,698 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-09-10 11:32:16,698 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 11:32:16,698 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 11:32:16,698 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 11:32:16,698 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 11:32:16,698 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 11:32:16,698 INFO L426 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,699 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,700 INFO L426 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-09-10 11:32:16,700 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-09-10 11:32:16,700 INFO L426 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-09-10 11:32:16,700 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 11:32:16,700 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 11:32:16,700 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 11:32:16,700 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 11:32:16,700 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 11:32:16,700 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-10 11:32:16,701 INFO L426 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-09-10 11:32:16,701 INFO L426 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-09-10 11:32:16,701 INFO L426 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-09-10 11:32:16,701 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 178) no Hoare annotation was computed. [2018-09-10 11:32:16,701 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-09-10 11:32:16,701 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,701 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,701 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,701 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,702 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,702 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,702 INFO L426 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-09-10 11:32:16,702 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-09-10 11:32:16,702 INFO L426 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-09-10 11:32:16,702 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 11:32:16,702 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 11:32:16,702 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,703 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 11:32:16,704 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 11:32:16,705 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 11:32:16,705 INFO L426 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-09-10 11:32:16,705 INFO L426 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-09-10 11:32:16,705 INFO L426 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-09-10 11:32:16,705 INFO L426 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-09-10 11:32:16,705 INFO L426 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-09-10 11:32:16,705 INFO L426 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-09-10 11:32:16,705 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,705 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 11:32:16,706 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,707 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 11:32:16,708 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 11:32:16,709 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|))) (let ((.cse4 (and .cse5 .cse6)) (.cse1 (and .cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) .cse6)) (.cse3 (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (.cse0 (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0))) (.cse2 (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)))) (and (or .cse0 .cse1 .cse2 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)| 2) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)| 333899)) (< 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (or .cse0 .cse2 .cse3 (= 4 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) .cse1) (or .cse0 .cse4 .cse2 (not (= 3 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|))) (or .cse4 .cse0 .cse2 (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (or .cse1 (or .cse0 .cse2 (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) .cse3)) (or (and .cse5 (= 2 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) .cse0 .cse2 (not (= 2 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)))))) [2018-09-10 11:32:16,709 INFO L426 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-09-10 11:32:16,709 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-09-10 11:32:16,709 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-09-10 11:32:16,709 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 11:32:16,709 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 218) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 6)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 14) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0 0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10))) [2018-09-10 11:32:16,710 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 11:32:16,710 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 11:32:16,710 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (< 218 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) [2018-09-10 11:32:16,710 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:32:16,710 INFO L422 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 6))) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10))) (.cse0 (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (or (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and (not (= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) .cse0 .cse1) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (and .cse0 (= 2 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 0) .cse0) (and (= 3 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) .cse0) (< 218 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 333899) 0) (<= 2 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) .cse0 .cse2) (and (and .cse1 .cse2) .cse0) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)) (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) [2018-09-10 11:32:16,710 INFO L426 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-09-10 11:32:16,710 INFO L426 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-09-10 11:32:16,711 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-09-10 11:32:16,711 INFO L422 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 6))) (.cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 10))) (.cse0 (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) (or (not (= 0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12~0)) (and (not (= 4 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) .cse0 .cse1) (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|)) (and .cse0 (= 2 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)) (< 0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0)|) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0 0) .cse0) (and (= 3 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) .cse0) (< 218 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0)|) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1~0 333899) 0) (<= 2 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10~0) .cse0 .cse2) (and (and .cse1 .cse2) .cse0) (not (= 14 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0)) (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19~0)|))) [2018-09-10 11:32:16,711 INFO L426 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-09-10 11:32:16,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:32:16 BoogieIcfgContainer [2018-09-10 11:32:16,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 11:32:16,733 INFO L168 Benchmark]: Toolchain (without parser) took 45588.11 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -376.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-10 11:32:16,734 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 11:32:16,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.79 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 11:32:16,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.00 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 11:32:16,736 INFO L168 Benchmark]: Boogie Preprocessor took 248.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -876.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-10 11:32:16,737 INFO L168 Benchmark]: RCFGBuilder took 3311.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 7.1 GB. [2018-09-10 11:32:16,738 INFO L168 Benchmark]: TraceAbstraction took 41220.40 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 611.8 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 328.3 MB). Peak memory consumption was 940.2 MB. Max. memory is 7.1 GB. [2018-09-10 11:32:16,746 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 676.79 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 123.00 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 248.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -876.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3311.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41220.40 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 611.8 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 328.3 MB). Peak memory consumption was 940.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 178]: 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: 582]: Loop Invariant Derived loop invariant: (((((((((((!(0 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a12) || ((!(4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 6))) || 10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10))) || (9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) && 2 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || 0 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 <= 0 && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19))) || (3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10 && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19))) || 218 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a1 + 333899 <= 0 && 2 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a10) && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 10))) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 6) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19 == 10)) && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19))) || !(14 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4)) || 6 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a19) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 41.1s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 26.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 694 SDtfs, 6227 SDslu, 947 SDs, 0 SdLazy, 11283 SolverSat, 2512 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4867 GetRequests, 4765 SyntacticMatches, 18 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3165occurred in iteration=7, 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: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 1084 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 129 PreInvPairs, 227 NumberOfFragments, 394 HoareAnnotationTreeSize, 129 FomulaSimplifications, 13886 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12667 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 4539 NumberOfCodeBlocks, 4539 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 6899 ConstructedInterpolants, 0 QuantifiedInterpolants, 5461385 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3826 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 22 InterpolantComputations, 5 PerfectInterpolantSequences, 6684/7270 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/Problem10_label18_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_11-32-16-784.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label18_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_11-32-16-784.csv Received shutdown request...