java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 12:47:15,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 12:47:15,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 12:47:15,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 12:47:15,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 12:47:15,367 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 12:47:15,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 12:47:15,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 12:47:15,374 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 12:47:15,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 12:47:15,377 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 12:47:15,378 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 12:47:15,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 12:47:15,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 12:47:15,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 12:47:15,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 12:47:15,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 12:47:15,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 12:47:15,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 12:47:15,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 12:47:15,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 12:47:15,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 12:47:15,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 12:47:15,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 12:47:15,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 12:47:15,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 12:47:15,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 12:47:15,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 12:47:15,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 12:47:15,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 12:47:15,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 12:47:15,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 12:47:15,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 12:47:15,411 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 12:47:15,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 12:47:15,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 12:47:15,412 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-07-24 12:47:15,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 12:47:15,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 12:47:15,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 12:47:15,428 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 12:47:15,429 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 12:47:15,429 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 12:47:15,429 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 12:47:15,429 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 12:47:15,429 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 12:47:15,430 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 12:47:15,430 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 12:47:15,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 12:47:15,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 12:47:15,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 12:47:15,431 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 12:47:15,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 12:47:15,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 12:47:15,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 12:47:15,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 12:47:15,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 12:47:15,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 12:47:15,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 12:47:15,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 12:47:15,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 12:47:15,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 12:47:15,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 12:47:15,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 12:47:15,434 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 12:47:15,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 12:47:15,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 12:47:15,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 12:47:15,434 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 12:47:15,435 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 12:47:15,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 12:47:15,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 12:47:15,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 12:47:15,502 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 12:47:15,502 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 12:47:15,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-07-24 12:47:15,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f825731b/1f2880ff5847420987a4d42a24b66f63/FLAGd9ac5980a [2018-07-24 12:47:16,157 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 12:47:16,158 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-07-24 12:47:16,177 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f825731b/1f2880ff5847420987a4d42a24b66f63/FLAGd9ac5980a [2018-07-24 12:47:16,195 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f825731b/1f2880ff5847420987a4d42a24b66f63 [2018-07-24 12:47:16,209 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 12:47:16,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 12:47:16,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 12:47:16,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 12:47:16,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 12:47:16,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:47:16" (1/1) ... [2018-07-24 12:47:16,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e46634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:16, skipping insertion in model container [2018-07-24 12:47:16,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:47:16" (1/1) ... [2018-07-24 12:47:16,496 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 12:47:16,822 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:47:16,848 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 12:47:16,970 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 12:47:17,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17 WrapperNode [2018-07-24 12:47:17,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 12:47:17,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 12:47:17,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 12:47:17,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 12:47:17,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 12:47:17,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 12:47:17,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 12:47:17,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 12:47:17,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (1/1) ... [2018-07-24 12:47:17,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 12:47:17,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 12:47:17,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 12:47:17,193 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 12:47:17,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (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-07-24 12:47:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-07-24 12:47:17,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-07-24 12:47:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 12:47:17,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 12:47:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 12:47:17,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 12:47:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 12:47:17,412 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 12:47:20,681 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 12:47:20,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:47:20 BoogieIcfgContainer [2018-07-24 12:47:20,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 12:47:20,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 12:47:20,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 12:47:20,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 12:47:20,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 12:47:16" (1/3) ... [2018-07-24 12:47:20,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a85b87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:47:20, skipping insertion in model container [2018-07-24 12:47:20,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:47:17" (2/3) ... [2018-07-24 12:47:20,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a85b87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 12:47:20, skipping insertion in model container [2018-07-24 12:47:20,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 12:47:20" (3/3) ... [2018-07-24 12:47:20,695 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label51_true-unreach-call_false-termination.c [2018-07-24 12:47:20,706 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 12:47:20,723 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 12:47:20,781 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 12:47:20,782 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 12:47:20,782 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 12:47:20,782 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 12:47:20,783 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 12:47:20,783 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 12:47:20,783 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 12:47:20,783 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 12:47:20,784 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 12:47:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-07-24 12:47:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-24 12:47:20,830 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:20,831 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:20,832 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:20,838 INFO L82 PathProgramCache]: Analyzing trace with hash 635508309, now seen corresponding path program 1 times [2018-07-24 12:47:20,841 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:20,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:20,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:21,487 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:47:21,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:21,642 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:21,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 12:47:21,642 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:21,649 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:21,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:21,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:47:21,668 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-07-24 12:47:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:23,368 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-07-24 12:47:23,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:23,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-07-24 12:47:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:23,393 INFO L225 Difference]: With dead ends: 627 [2018-07-24 12:47:23,393 INFO L226 Difference]: Without dead ends: 388 [2018-07-24 12:47:23,401 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 12:47:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-07-24 12:47:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-07-24 12:47:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-07-24 12:47:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-07-24 12:47:23,490 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 117 [2018-07-24 12:47:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:23,491 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-07-24 12:47:23,491 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-07-24 12:47:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-24 12:47:23,500 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:23,501 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:23,501 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash -442392214, now seen corresponding path program 1 times [2018-07-24 12:47:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:23,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:23,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:23,962 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:23,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:23,963 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:23,965 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:23,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:23,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:23,969 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-07-24 12:47:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:25,828 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-07-24 12:47:25,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:25,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-07-24 12:47:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:25,837 INFO L225 Difference]: With dead ends: 905 [2018-07-24 12:47:25,837 INFO L226 Difference]: Without dead ends: 382 [2018-07-24 12:47:25,844 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-24 12:47:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-07-24 12:47:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-07-24 12:47:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-07-24 12:47:25,870 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 126 [2018-07-24 12:47:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:25,870 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-07-24 12:47:25,871 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-07-24 12:47:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-24 12:47:25,873 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:25,874 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:25,874 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1529922130, now seen corresponding path program 1 times [2018-07-24 12:47:25,875 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:25,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:25,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:25,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:25,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:26,082 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:26,082 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:47:26,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:26,083 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:47:26,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:47:26,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:47:26,084 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-07-24 12:47:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:28,478 INFO L93 Difference]: Finished difference Result 1189 states and 1998 transitions. [2018-07-24 12:47:28,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:47:28,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-07-24 12:47:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:28,486 INFO L225 Difference]: With dead ends: 1189 [2018-07-24 12:47:28,487 INFO L226 Difference]: Without dead ends: 813 [2018-07-24 12:47:28,489 INFO L573 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-07-24 12:47:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-07-24 12:47:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 796. [2018-07-24 12:47:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-07-24 12:47:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1232 transitions. [2018-07-24 12:47:28,555 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1232 transitions. Word has length 128 [2018-07-24 12:47:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:28,555 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1232 transitions. [2018-07-24 12:47:28,555 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:47:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1232 transitions. [2018-07-24 12:47:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-24 12:47:28,558 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:28,559 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:28,559 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 630779932, now seen corresponding path program 1 times [2018-07-24 12:47:28,560 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:28,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:28,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:28,904 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:28,904 INFO L191 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-07-24 12:47:28,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:28,914 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:29,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:29,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:29,283 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:47:29,284 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-07-24 12:47:29,284 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:29,284 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:29,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:29,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:47:29,287 INFO L87 Difference]: Start difference. First operand 796 states and 1232 transitions. Second operand 3 states. [2018-07-24 12:47:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:31,198 INFO L93 Difference]: Finished difference Result 1880 states and 2960 transitions. [2018-07-24 12:47:31,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:31,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-07-24 12:47:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:31,209 INFO L225 Difference]: With dead ends: 1880 [2018-07-24 12:47:31,210 INFO L226 Difference]: Without dead ends: 1090 [2018-07-24 12:47:31,213 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:47:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-07-24 12:47:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1087. [2018-07-24 12:47:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2018-07-24 12:47:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1582 transitions. [2018-07-24 12:47:31,276 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1582 transitions. Word has length 131 [2018-07-24 12:47:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:31,277 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1582 transitions. [2018-07-24 12:47:31,277 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1582 transitions. [2018-07-24 12:47:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-24 12:47:31,282 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:31,283 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:31,283 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash 635907820, now seen corresponding path program 1 times [2018-07-24 12:47:31,284 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:31,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:31,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:31,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:31,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:31,508 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:31,508 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:47:31,508 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:31,508 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:47:31,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:47:31,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:47:31,509 INFO L87 Difference]: Start difference. First operand 1087 states and 1582 transitions. Second operand 6 states. [2018-07-24 12:47:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:33,147 INFO L93 Difference]: Finished difference Result 2614 states and 3945 transitions. [2018-07-24 12:47:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:47:33,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-07-24 12:47:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:33,159 INFO L225 Difference]: With dead ends: 2614 [2018-07-24 12:47:33,160 INFO L226 Difference]: Without dead ends: 1533 [2018-07-24 12:47:33,166 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:47:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-07-24 12:47:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1515. [2018-07-24 12:47:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2018-07-24 12:47:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2180 transitions. [2018-07-24 12:47:33,212 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2180 transitions. Word has length 139 [2018-07-24 12:47:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:33,212 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2180 transitions. [2018-07-24 12:47:33,212 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:47:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2180 transitions. [2018-07-24 12:47:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-24 12:47:33,218 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:33,218 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:33,219 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:33,219 INFO L82 PathProgramCache]: Analyzing trace with hash -103944239, now seen corresponding path program 1 times [2018-07-24 12:47:33,219 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:33,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:33,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:33,566 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:33,566 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:33,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:33,566 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:33,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:33,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:33,567 INFO L87 Difference]: Start difference. First operand 1515 states and 2180 transitions. Second operand 5 states. [2018-07-24 12:47:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:34,620 INFO L93 Difference]: Finished difference Result 3159 states and 4585 transitions. [2018-07-24 12:47:34,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:34,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-07-24 12:47:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:34,629 INFO L225 Difference]: With dead ends: 3159 [2018-07-24 12:47:34,629 INFO L226 Difference]: Without dead ends: 1502 [2018-07-24 12:47:34,635 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-07-24 12:47:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2018-07-24 12:47:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2018-07-24 12:47:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2143 transitions. [2018-07-24 12:47:34,674 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2143 transitions. Word has length 142 [2018-07-24 12:47:34,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:34,675 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2143 transitions. [2018-07-24 12:47:34,675 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2143 transitions. [2018-07-24 12:47:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-24 12:47:34,680 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:34,680 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 12:47:34,680 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:34,681 INFO L82 PathProgramCache]: Analyzing trace with hash -573200363, now seen corresponding path program 1 times [2018-07-24 12:47:34,681 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:34,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:34,682 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:34,953 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:34,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 12:47:34,953 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:34,954 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:34,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:34,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:34,954 INFO L87 Difference]: Start difference. First operand 1502 states and 2143 transitions. Second operand 5 states. [2018-07-24 12:47:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:38,524 INFO L93 Difference]: Finished difference Result 3145 states and 4544 transitions. [2018-07-24 12:47:38,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:38,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-07-24 12:47:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:38,534 INFO L225 Difference]: With dead ends: 3145 [2018-07-24 12:47:38,534 INFO L226 Difference]: Without dead ends: 1501 [2018-07-24 12:47:38,540 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 12:47:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2018-07-24 12:47:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2018-07-24 12:47:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2018-07-24 12:47:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2111 transitions. [2018-07-24 12:47:38,579 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2111 transitions. Word has length 144 [2018-07-24 12:47:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:38,579 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 2111 transitions. [2018-07-24 12:47:38,579 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2111 transitions. [2018-07-24 12:47:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-24 12:47:38,585 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:38,585 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 12:47:38,585 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash 845238497, now seen corresponding path program 1 times [2018-07-24 12:47:38,586 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:38,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:38,587 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:38,847 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:38,848 INFO L191 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-07-24 12:47:38,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:38,856 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:38,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:39,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:39,106 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:47:39,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-07-24 12:47:39,106 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:39,107 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:39,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:39,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:47:39,108 INFO L87 Difference]: Start difference. First operand 1501 states and 2111 transitions. Second operand 3 states. [2018-07-24 12:47:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:40,349 INFO L93 Difference]: Finished difference Result 3296 states and 4728 transitions. [2018-07-24 12:47:40,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:40,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2018-07-24 12:47:40,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:40,361 INFO L225 Difference]: With dead ends: 3296 [2018-07-24 12:47:40,362 INFO L226 Difference]: Without dead ends: 1801 [2018-07-24 12:47:40,368 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 299 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:47:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2018-07-24 12:47:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1797. [2018-07-24 12:47:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-07-24 12:47:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2494 transitions. [2018-07-24 12:47:40,414 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2494 transitions. Word has length 150 [2018-07-24 12:47:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:40,414 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2494 transitions. [2018-07-24 12:47:40,414 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2494 transitions. [2018-07-24 12:47:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-24 12:47:40,421 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:40,421 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 12:47:40,421 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash 829163813, now seen corresponding path program 1 times [2018-07-24 12:47:40,422 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:40,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:40,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:40,627 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:40,627 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 12:47:40,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:40,636 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:40,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:40,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:40,902 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 12:47:40,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-07-24 12:47:40,902 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:40,902 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 12:47:40,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 12:47:40,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:47:40,903 INFO L87 Difference]: Start difference. First operand 1797 states and 2494 transitions. Second operand 3 states. [2018-07-24 12:47:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:41,665 INFO L93 Difference]: Finished difference Result 3589 states and 5018 transitions. [2018-07-24 12:47:41,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 12:47:41,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-07-24 12:47:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:41,673 INFO L225 Difference]: With dead ends: 3589 [2018-07-24 12:47:41,673 INFO L226 Difference]: Without dead ends: 1798 [2018-07-24 12:47:41,681 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 303 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-24 12:47:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2018-07-24 12:47:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1797. [2018-07-24 12:47:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-07-24 12:47:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2316 transitions. [2018-07-24 12:47:41,733 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2316 transitions. Word has length 152 [2018-07-24 12:47:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:41,734 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2316 transitions. [2018-07-24 12:47:41,734 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 12:47:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2316 transitions. [2018-07-24 12:47:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-24 12:47:41,742 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:41,743 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-24 12:47:41,743 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:41,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1009037197, now seen corresponding path program 1 times [2018-07-24 12:47:41,744 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:41,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:41,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:41,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:41,971 WARN L169 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:47:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 12:47:42,203 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 12:47:42,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 12:47:42,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:42,204 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 12:47:42,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 12:47:42,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 12:47:42,205 INFO L87 Difference]: Start difference. First operand 1797 states and 2316 transitions. Second operand 6 states. [2018-07-24 12:47:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:43,622 INFO L93 Difference]: Finished difference Result 5330 states and 7249 transitions. [2018-07-24 12:47:43,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 12:47:43,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-07-24 12:47:43,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:43,639 INFO L225 Difference]: With dead ends: 5330 [2018-07-24 12:47:43,640 INFO L226 Difference]: Without dead ends: 3539 [2018-07-24 12:47:43,649 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-24 12:47:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2018-07-24 12:47:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3466. [2018-07-24 12:47:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3466 states. [2018-07-24 12:47:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 4360 transitions. [2018-07-24 12:47:43,742 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 4360 transitions. Word has length 155 [2018-07-24 12:47:43,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:43,743 INFO L471 AbstractCegarLoop]: Abstraction has 3466 states and 4360 transitions. [2018-07-24 12:47:43,743 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 12:47:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 4360 transitions. [2018-07-24 12:47:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-07-24 12:47:43,756 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:43,756 INFO L353 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, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 12:47:43,757 INFO L414 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:43,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1592539393, now seen corresponding path program 1 times [2018-07-24 12:47:43,757 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:43,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:43,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:43,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:43,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-07-24 12:47:43,914 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:43,914 INFO L191 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-07-24 12:47:43,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:43,922 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:44,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:44,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:44,693 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:44,693 INFO L191 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-07-24 12:47:44,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:44,722 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:44,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:45,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 12:47:45,334 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 12:47:45,334 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 16 [2018-07-24 12:47:45,334 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 12:47:45,335 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 12:47:45,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 12:47:45,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-07-24 12:47:45,336 INFO L87 Difference]: Start difference. First operand 3466 states and 4360 transitions. Second operand 9 states. [2018-07-24 12:47:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:50,647 INFO L93 Difference]: Finished difference Result 11314 states and 15981 transitions. [2018-07-24 12:47:50,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-24 12:47:50,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-07-24 12:47:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:50,673 INFO L225 Difference]: With dead ends: 11314 [2018-07-24 12:47:50,674 INFO L226 Difference]: Without dead ends: 3697 [2018-07-24 12:47:50,716 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 937 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=371, Invalid=1351, Unknown=0, NotChecked=0, Total=1722 [2018-07-24 12:47:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2018-07-24 12:47:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3422. [2018-07-24 12:47:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3422 states. [2018-07-24 12:47:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 3902 transitions. [2018-07-24 12:47:50,815 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 3902 transitions. Word has length 231 [2018-07-24 12:47:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:50,815 INFO L471 AbstractCegarLoop]: Abstraction has 3422 states and 3902 transitions. [2018-07-24 12:47:50,816 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 12:47:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 3902 transitions. [2018-07-24 12:47:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-07-24 12:47:50,827 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 12:47:50,827 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 12:47:50,828 INFO L414 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 12:47:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash -839929279, now seen corresponding path program 1 times [2018-07-24 12:47:50,828 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 12:47:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:50,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 12:47:50,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 12:47:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:51,106 WARN L169 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-24 12:47:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 125 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-24 12:47:51,343 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:51,343 INFO L191 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-07-24 12:47:51,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:51,352 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:51,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 186 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:47:51,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:52,137 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-07-24 12:47:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 186 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-24 12:47:52,688 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 12:47:52,689 INFO L191 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-07-24 12:47:52,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 12:47:52,707 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 12:47:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 12:47:52,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 12:47:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 125 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-24 12:47:53,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 12:47:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-24 12:47:53,645 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-07-24 12:47:53,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 5] total 11 [2018-07-24 12:47:53,646 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 12:47:53,647 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 12:47:53,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 12:47:53,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-24 12:47:53,648 INFO L87 Difference]: Start difference. First operand 3422 states and 3902 transitions. Second operand 5 states. [2018-07-24 12:47:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 12:47:54,125 INFO L93 Difference]: Finished difference Result 5720 states and 6513 transitions. [2018-07-24 12:47:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 12:47:54,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2018-07-24 12:47:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 12:47:54,133 INFO L225 Difference]: With dead ends: 5720 [2018-07-24 12:47:54,134 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 12:47:54,145 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1005 GetRequests, 983 SyntacticMatches, 13 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-24 12:47:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 12:47:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 12:47:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 12:47:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 12:47:54,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2018-07-24 12:47:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 12:47:54,149 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 12:47:54,149 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 12:47:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 12:47:54,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 12:47:54,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 12:47:54,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,514 WARN L169 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 105 [2018-07-24 12:47:54,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 12:47:54,807 WARN L169 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 105 [2018-07-24 12:47:56,022 WARN L169 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-07-24 12:47:56,573 WARN L169 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-07-24 12:47:58,409 WARN L169 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 163 DAG size of output: 68 [2018-07-24 12:47:58,447 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-07-24 12:47:58,447 INFO L421 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-07-24 12:47:58,447 INFO L421 ceAbstractionStarter]: For program point L203''(lines 203 210) no Hoare annotation was computed. [2018-07-24 12:47:58,447 INFO L421 ceAbstractionStarter]: For program point L417'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,448 INFO L421 ceAbstractionStarter]: For program point L429'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,448 INFO L421 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-07-24 12:47:58,448 INFO L421 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-07-24 12:47:58,448 INFO L421 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-07-24 12:47:58,448 INFO L421 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-07-24 12:47:58,448 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,448 INFO L421 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-07-24 12:47:58,448 INFO L421 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L501'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L513'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L525'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L537'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L549'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L507'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L519'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L504'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L516'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L528'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L238''(lines 238 246) no Hoare annotation was computed. [2018-07-24 12:47:58,449 INFO L421 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-07-24 12:47:58,450 INFO L421 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-07-24 12:47:58,450 INFO L421 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-07-24 12:47:58,450 INFO L417 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) (.cse15 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1)) (.cse17 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse18 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse19 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse20 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|))) (let ((.cse12 (and .cse17 .cse18 .cse19 .cse20)) (.cse14 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse11 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 8))) (.cse5 (not .cse15)) (.cse8 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse9 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse10 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)) (.cse6 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0)| 1))) (.cse7 (not .cse3)) (.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (.cse1 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9)) (.cse13 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 10)) (.cse16 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) (.cse2 (and .cse17 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) .cse18 .cse19 .cse20))) (and (or (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) .cse0 .cse1 .cse2) (or .cse0 .cse2 .cse1 .cse3) (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 7)) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse4) .cse0 .cse5 .cse6 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 7)) .cse7) (or .cse0 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| 9)) (and .cse8 .cse9 .cse10 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) .cse11 .cse5 .cse6 .cse7) (or .cse0 .cse12 .cse5 .cse13 .cse14) (or .cse0 .cse15 .cse12 .cse14 .cse16) (or .cse0 .cse11 .cse5 (not .cse13) (and .cse8 .cse9 .cse10 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse4) .cse6 .cse7) (or .cse0 .cse15 .cse1 .cse13 .cse16 .cse2)))) [2018-07-24 12:47:58,450 INFO L421 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-07-24 12:47:58,451 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-07-24 12:47:58,451 INFO L421 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-07-24 12:47:58,451 INFO L421 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-07-24 12:47:58,451 INFO L421 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-07-24 12:47:58,451 INFO L421 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-07-24 12:47:58,451 INFO L421 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-07-24 12:47:58,451 INFO L421 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-07-24 12:47:58,451 INFO L421 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L480'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L492'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-07-24 12:47:58,452 INFO L421 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-07-24 12:47:58,453 INFO L421 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-07-24 12:47:58,453 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-07-24 12:47:58,453 INFO L421 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-07-24 12:47:58,453 INFO L421 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-07-24 12:47:58,453 INFO L421 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-07-24 12:47:58,453 INFO L421 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-07-24 12:47:58,453 INFO L421 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-07-24 12:47:58,453 INFO L421 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-07-24 12:47:58,453 INFO L421 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-07-24 12:47:58,454 INFO L421 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-07-24 12:47:58,454 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-07-24 12:47:58,454 INFO L421 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-07-24 12:47:58,454 INFO L421 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-07-24 12:47:58,454 INFO L421 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-07-24 12:47:58,454 INFO L421 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-07-24 12:47:58,454 INFO L421 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-07-24 12:47:58,454 INFO L421 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-07-24 12:47:58,454 INFO L421 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-07-24 12:47:58,455 INFO L421 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-07-24 12:47:58,455 INFO L421 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-07-24 12:47:58,455 INFO L421 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-07-24 12:47:58,455 INFO L421 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-07-24 12:47:58,455 INFO L421 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-07-24 12:47:58,455 INFO L421 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-07-24 12:47:58,455 INFO L421 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-07-24 12:47:58,455 INFO L421 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-07-24 12:47:58,455 INFO L421 ceAbstractionStarter]: For program point L332''(lines 332 335) no Hoare annotation was computed. [2018-07-24 12:47:58,456 INFO L421 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-07-24 12:47:58,456 INFO L421 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-07-24 12:47:58,456 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-07-24 12:47:58,456 INFO L421 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-07-24 12:47:58,456 INFO L421 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-07-24 12:47:58,456 INFO L421 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-07-24 12:47:58,456 INFO L421 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-07-24 12:47:58,456 INFO L421 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-07-24 12:47:58,456 INFO L421 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-07-24 12:47:58,457 INFO L421 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-07-24 12:47:58,457 INFO L421 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-07-24 12:47:58,457 INFO L421 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-07-24 12:47:58,457 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION(line 502) no Hoare annotation was computed. [2018-07-24 12:47:58,457 INFO L421 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-07-24 12:47:58,457 INFO L421 ceAbstractionStarter]: For program point L570'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,457 INFO L421 ceAbstractionStarter]: For program point L582'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,457 INFO L421 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-07-24 12:47:58,457 INFO L421 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-07-24 12:47:58,458 INFO L421 ceAbstractionStarter]: For program point L594'(lines 594 596) no Hoare annotation was computed. [2018-07-24 12:47:58,458 INFO L421 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-07-24 12:47:58,458 INFO L421 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-07-24 12:47:58,458 INFO L421 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-07-24 12:47:58,458 INFO L421 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-07-24 12:47:58,458 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-07-24 12:47:58,458 INFO L421 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-07-24 12:47:58,458 INFO L421 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-07-24 12:47:58,459 INFO L421 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-07-24 12:47:58,459 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-07-24 12:47:58,459 INFO L421 ceAbstractionStarter]: For program point L298''(lines 298 307) no Hoare annotation was computed. [2018-07-24 12:47:58,459 INFO L421 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-07-24 12:47:58,459 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-07-24 12:47:58,459 INFO L421 ceAbstractionStarter]: For program point L591'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,459 INFO L421 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-07-24 12:47:58,459 INFO L421 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-07-24 12:47:58,459 INFO L421 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-07-24 12:47:58,460 INFO L421 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-07-24 12:47:58,460 INFO L421 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-07-24 12:47:58,460 INFO L421 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-07-24 12:47:58,460 INFO L421 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-07-24 12:47:58,460 INFO L421 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-07-24 12:47:58,460 INFO L421 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-07-24 12:47:58,460 INFO L421 ceAbstractionStarter]: For program point L471'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,460 INFO L421 ceAbstractionStarter]: For program point L483'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,460 INFO L421 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-07-24 12:47:58,461 INFO L421 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-07-24 12:47:58,461 INFO L421 ceAbstractionStarter]: For program point L495'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,461 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-07-24 12:47:58,461 INFO L421 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-07-24 12:47:58,461 INFO L421 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-07-24 12:47:58,461 INFO L421 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-07-24 12:47:58,461 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-07-24 12:47:58,461 INFO L421 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-07-24 12:47:58,461 INFO L421 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-07-24 12:47:58,462 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-07-24 12:47:58,462 INFO L421 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-07-24 12:47:58,462 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-07-24 12:47:58,462 INFO L421 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-07-24 12:47:58,462 INFO L421 ceAbstractionStarter]: For program point L561'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,462 INFO L421 ceAbstractionStarter]: For program point L573'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,462 INFO L421 ceAbstractionStarter]: For program point L585'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,462 INFO L421 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-07-24 12:47:58,462 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-07-24 12:47:58,463 INFO L421 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-07-24 12:47:58,463 INFO L421 ceAbstractionStarter]: For program point L477'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,463 INFO L421 ceAbstractionStarter]: For program point L489'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,463 INFO L421 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-07-24 12:47:58,463 INFO L421 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-07-24 12:47:58,463 INFO L421 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-07-24 12:47:58,463 INFO L421 ceAbstractionStarter]: For program point L441'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,463 INFO L421 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-07-24 12:47:58,463 INFO L421 ceAbstractionStarter]: For program point L453'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,464 INFO L421 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-07-24 12:47:58,464 INFO L421 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-07-24 12:47:58,464 INFO L421 ceAbstractionStarter]: For program point L465'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,464 INFO L421 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-07-24 12:47:58,464 INFO L421 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-07-24 12:47:58,464 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-07-24 12:47:58,464 INFO L421 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-07-24 12:47:58,464 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,464 INFO L421 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L75''(lines 75 80) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L450'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L462'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L474'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L486'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L498'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,465 INFO L421 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-07-24 12:47:58,466 INFO L421 ceAbstractionStarter]: For program point L420'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L432'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L414''(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L381''(lines 381 387) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-07-24 12:47:58,467 INFO L421 ceAbstractionStarter]: For program point L83''(lines 83 89) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L543'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L555'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L567'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L579'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L576'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L588'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L540'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L552'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,468 INFO L421 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L564'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L444'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L456'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L468'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L338''(lines 338 347) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L315''(lines 315 326) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L262''(lines 262 274) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L510'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L522'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,469 INFO L421 ceAbstractionStarter]: For program point L534'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L546'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L558'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L426'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L438'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L531'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-07-24 12:47:58,470 INFO L421 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-07-24 12:47:58,471 INFO L421 ceAbstractionStarter]: For program point L423'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,471 INFO L421 ceAbstractionStarter]: For program point L435'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,471 INFO L421 ceAbstractionStarter]: For program point L447'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,471 INFO L421 ceAbstractionStarter]: For program point L459'(lines 29 598) no Hoare annotation was computed. [2018-07-24 12:47:58,471 INFO L421 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-07-24 12:47:58,471 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-07-24 12:47:58,471 INFO L421 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-07-24 12:47:58,471 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-07-24 12:47:58,471 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (or (not (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|)) [2018-07-24 12:47:58,471 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-07-24 12:47:58,472 INFO L417 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1)) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) [2018-07-24 12:47:58,472 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-07-24 12:47:58,472 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 12:47:58,472 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 12:47:58,472 INFO L421 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-07-24 12:47:58,472 INFO L421 ceAbstractionStarter]: For program point L606'''(lines 600 617) no Hoare annotation was computed. [2018-07-24 12:47:58,472 INFO L417 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse5 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse8 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10))) (.cse9 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse6 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse7 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (and .cse2 (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) .cse3 .cse4) (and .cse5 .cse6 .cse4 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse7) (and .cse0 .cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (and .cse0 .cse1 .cse8 .cse3 .cse9) (and .cse5 .cse6 .cse4 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse7) (and .cse8 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) .cse2 .cse9) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse1 .cse2 .cse3 .cse9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse6 .cse4 .cse7))) [2018-07-24 12:47:58,473 INFO L417 ceAbstractionStarter]: At program point L606''(lines 606 616) the Hoare annotation is: (let ((.cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9))) (.cse5 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)) (.cse8 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|)) (.cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (.cse3 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10))) (.cse9 (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)) (.cse6 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)) (.cse7 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0))) (or (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (and .cse0 .cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1))) (and .cse2 (<= 9 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) .cse3 .cse4) (and .cse5 .cse6 .cse4 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse7) (and .cse0 .cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (and .cse0 .cse1 .cse8 .cse3 .cse9) (and .cse5 .cse6 .cse4 (= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) .cse7) (and .cse8 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 9)) .cse2 .cse9) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (and .cse1 .cse2 .cse3 .cse9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1) (and (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0) .cse6 .cse4 .cse7))) [2018-07-24 12:47:58,473 INFO L421 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-07-24 12:47:58,473 INFO L417 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 9)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)|)) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0)|) (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0)| 1) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0)| 9) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0)| 1)) [2018-07-24 12:47:58,473 INFO L421 ceAbstractionStarter]: For program point L614'(line 614) no Hoare annotation was computed. [2018-07-24 12:47:58,473 INFO L421 ceAbstractionStarter]: For program point L606(lines 606 616) no Hoare annotation was computed. [2018-07-24 12:47:58,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 12:47:58 BoogieIcfgContainer [2018-07-24 12:47:58,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 12:47:58,502 INFO L168 Benchmark]: Toolchain (without parser) took 42292.14 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-07-24 12:47:58,505 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-07-24 12:47:58,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-24 12:47:58,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 12:47:58,507 INFO L168 Benchmark]: Boogie Preprocessor took 87.77 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-07-24 12:47:58,508 INFO L168 Benchmark]: RCFGBuilder took 3490.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -754.5 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2018-07-24 12:47:58,509 INFO L168 Benchmark]: TraceAbstraction took 37817.92 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 411.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -50.9 MB). Peak memory consumption was 946.1 MB. Max. memory is 7.1 GB. [2018-07-24 12:47:58,515 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 799.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 87.77 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. * RCFGBuilder took 3490.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -754.5 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37817.92 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 411.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -50.9 MB). Peak memory consumption was 946.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 502]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 7 && 9 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25)) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || ((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 <= 7)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10)) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || ((((8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 9 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 9)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 7) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || 7 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 7) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10)) && 9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) == 1) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) == 9) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) == 1) || ((((7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 37.7s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 23.6s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1894 SDtfs, 6401 SDslu, 1455 SDs, 0 SdLazy, 10914 SolverSat, 1917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2933 GetRequests, 2801 SyntacticMatches, 33 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3466occurred in iteration=10, 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, 12 MinimizatonAttempts, 396 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 206 PreInvPairs, 418 NumberOfFragments, 643 HoareAnnotationTreeSize, 206 FomulaSimplifications, 25476 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4148 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3257 NumberOfCodeBlocks, 3257 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4624 ConstructedInterpolants, 0 QuantifiedInterpolants, 2741328 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3211 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 2173/2336 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label51_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_12-47-58-533.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label51_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_12-47-58-533.csv Received shutdown request...