java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label24_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 12:02:50,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 12:02:50,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 12:02:50,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 12:02:50,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 12:02:50,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 12:02:50,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 12:02:50,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 12:02:50,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 12:02:50,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 12:02:50,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 12:02:50,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 12:02:50,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 12:02:50,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 12:02:50,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 12:02:50,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 12:02:50,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 12:02:50,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 12:02:50,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 12:02:50,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 12:02:50,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 12:02:50,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 12:02:50,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 12:02:50,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 12:02:50,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 12:02:50,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 12:02:50,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 12:02:50,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 12:02:50,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 12:02:50,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 12:02:50,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 12:02:50,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 12:02:50,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 12:02:50,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 12:02:50,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 12:02:50,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 12:02:50,248 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 12:02:50,264 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 12:02:50,264 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 12:02:50,265 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 12:02:50,265 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 12:02:50,266 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 12:02:50,266 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 12:02:50,266 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 12:02:50,266 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 12:02:50,266 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 12:02:50,266 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 12:02:50,267 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 12:02:50,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 12:02:50,268 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 12:02:50,268 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 12:02:50,268 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 12:02:50,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 12:02:50,268 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 12:02:50,269 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 12:02:50,269 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 12:02:50,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 12:02:50,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 12:02:50,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 12:02:50,270 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 12:02:50,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:02:50,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 12:02:50,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 12:02:50,271 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 12:02:50,271 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 12:02:50,271 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 12:02:50,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 12:02:50,272 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 12:02:50,272 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 12:02:50,272 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 12:02:50,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 12:02:50,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 12:02:50,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 12:02:50,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 12:02:50,385 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 12:02:50,386 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label24_true-unreach-call_false-termination.c [2018-09-10 12:02:50,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a81f086/d079387555a949bab2b2e8144cbb0198/FLAG7dc48982e [2018-09-10 12:02:51,057 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 12:02:51,058 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label24_true-unreach-call_false-termination.c [2018-09-10 12:02:51,085 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a81f086/d079387555a949bab2b2e8144cbb0198/FLAG7dc48982e [2018-09-10 12:02:51,101 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a81f086/d079387555a949bab2b2e8144cbb0198 [2018-09-10 12:02:51,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 12:02:51,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 12:02:51,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 12:02:51,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 12:02:51,126 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 12:02:51,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:51,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6588efe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51, skipping insertion in model container [2018-09-10 12:02:51,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:51,394 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 12:02:51,754 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:02:51,775 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 12:02:51,906 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:02:51,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51 WrapperNode [2018-09-10 12:02:51,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 12:02:51,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 12:02:51,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 12:02:51,961 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 12:02:51,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:52,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:52,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 12:02:52,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 12:02:52,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 12:02:52,100 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 12:02:52,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:52,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:52,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:52,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:52,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:52,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:52,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... [2018-09-10 12:02:52,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 12:02:52,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 12:02:52,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 12:02:52,365 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 12:02:52,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:02:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 12:02:52,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 12:02:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 12:02:52,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 12:02:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 12:02:52,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 12:02:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 12:02:52,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 12:02:55,992 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 12:02:55,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:02:55 BoogieIcfgContainer [2018-09-10 12:02:55,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 12:02:55,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 12:02:55,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 12:02:55,999 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 12:02:55,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:02:51" (1/3) ... [2018-09-10 12:02:56,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ecd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:02:56, skipping insertion in model container [2018-09-10 12:02:56,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:02:51" (2/3) ... [2018-09-10 12:02:56,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ecd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:02:56, skipping insertion in model container [2018-09-10 12:02:56,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:02:55" (3/3) ... [2018-09-10 12:02:56,003 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label24_true-unreach-call_false-termination.c [2018-09-10 12:02:56,013 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 12:02:56,021 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 12:02:56,073 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 12:02:56,074 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 12:02:56,075 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 12:02:56,075 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 12:02:56,075 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 12:02:56,075 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 12:02:56,076 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 12:02:56,076 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 12:02:56,076 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 12:02:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-10 12:02:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-10 12:02:56,119 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:02:56,121 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:02:56,122 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:02:56,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1491053684, now seen corresponding path program 1 times [2018-09-10 12:02:56,132 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:02:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:02:56,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:02:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:02:56,182 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:02:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:02:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:02:56,599 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:02:56,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:02:56,600 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:02:56,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:02:56,624 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:02:56,624 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:02:56,627 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 4 states. [2018-09-10 12:03:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:00,118 INFO L93 Difference]: Finished difference Result 894 states and 1610 transitions. [2018-09-10 12:03:00,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:03:00,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-09-10 12:03:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:00,144 INFO L225 Difference]: With dead ends: 894 [2018-09-10 12:03:00,144 INFO L226 Difference]: Without dead ends: 633 [2018-09-10 12:03:00,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:03:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-09-10 12:03:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 434. [2018-09-10 12:03:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-10 12:03:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 662 transitions. [2018-09-10 12:03:00,254 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 662 transitions. Word has length 48 [2018-09-10 12:03:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:00,254 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 662 transitions. [2018-09-10 12:03:00,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:03:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 662 transitions. [2018-09-10 12:03:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-10 12:03:00,265 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:00,267 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:03:00,267 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1436892620, now seen corresponding path program 1 times [2018-09-10 12:03:00,268 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:00,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:00,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:00,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:00,270 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:00,598 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:03:00,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:03:00,599 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:03:00,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:03:00,601 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:03:00,601 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:03:00,602 INFO L87 Difference]: Start difference. First operand 434 states and 662 transitions. Second operand 4 states. [2018-09-10 12:03:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:03,692 INFO L93 Difference]: Finished difference Result 1594 states and 2544 transitions. [2018-09-10 12:03:03,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:03:03,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-09-10 12:03:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:03,704 INFO L225 Difference]: With dead ends: 1594 [2018-09-10 12:03:03,704 INFO L226 Difference]: Without dead ends: 1166 [2018-09-10 12:03:03,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:03:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2018-09-10 12:03:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2018-09-10 12:03:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2018-09-10 12:03:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1719 transitions. [2018-09-10 12:03:03,793 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1719 transitions. Word has length 132 [2018-09-10 12:03:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:03,794 INFO L480 AbstractCegarLoop]: Abstraction has 1166 states and 1719 transitions. [2018-09-10 12:03:03,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:03:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1719 transitions. [2018-09-10 12:03:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-10 12:03:03,809 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:03,809 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:03:03,810 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:03,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2114427684, now seen corresponding path program 1 times [2018-09-10 12:03:03,811 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:03,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:03,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:03,812 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:04,090 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:03:04,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:03:04,091 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:03:04,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:03:04,092 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:03:04,092 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:03:04,092 INFO L87 Difference]: Start difference. First operand 1166 states and 1719 transitions. Second operand 4 states. [2018-09-10 12:03:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:07,066 INFO L93 Difference]: Finished difference Result 4522 states and 6908 transitions. [2018-09-10 12:03:07,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:03:07,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-09-10 12:03:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:07,086 INFO L225 Difference]: With dead ends: 4522 [2018-09-10 12:03:07,086 INFO L226 Difference]: Without dead ends: 2244 [2018-09-10 12:03:07,116 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:03:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2018-09-10 12:03:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2244. [2018-09-10 12:03:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2018-09-10 12:03:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3179 transitions. [2018-09-10 12:03:07,203 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3179 transitions. Word has length 144 [2018-09-10 12:03:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:07,204 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 3179 transitions. [2018-09-10 12:03:07,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:03:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3179 transitions. [2018-09-10 12:03:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-10 12:03:07,217 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:07,217 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:03:07,219 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash 590068037, now seen corresponding path program 1 times [2018-09-10 12:03:07,219 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:07,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:07,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:07,221 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:07,486 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:07,486 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:03:07,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:07,497 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:07,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:07,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:08,158 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:08,159 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:03:08,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:08,175 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:08,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:08,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:08,724 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:03:08,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-10 12:03:08,724 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:03:08,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:03:08,727 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:03:08,727 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:03:08,727 INFO L87 Difference]: Start difference. First operand 2244 states and 3179 transitions. Second operand 9 states. [2018-09-10 12:03:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:15,357 INFO L93 Difference]: Finished difference Result 6564 states and 10198 transitions. [2018-09-10 12:03:15,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 12:03:15,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2018-09-10 12:03:15,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:15,399 INFO L225 Difference]: With dead ends: 6564 [2018-09-10 12:03:15,399 INFO L226 Difference]: Without dead ends: 3361 [2018-09-10 12:03:15,455 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 826 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-09-10 12:03:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2018-09-10 12:03:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3246. [2018-09-10 12:03:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3246 states. [2018-09-10 12:03:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 4180 transitions. [2018-09-10 12:03:15,598 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 4180 transitions. Word has length 207 [2018-09-10 12:03:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:15,599 INFO L480 AbstractCegarLoop]: Abstraction has 3246 states and 4180 transitions. [2018-09-10 12:03:15,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:03:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 4180 transitions. [2018-09-10 12:03:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-10 12:03:15,609 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:15,609 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:03:15,610 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:15,610 INFO L82 PathProgramCache]: Analyzing trace with hash 884978009, now seen corresponding path program 1 times [2018-09-10 12:03:15,610 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:15,612 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:15,956 WARN L175 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:03:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-09-10 12:03:16,410 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:16,411 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:03:16,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:16,430 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:16,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:16,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:17,026 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:17,026 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:03:17,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:17,055 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:17,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-10 12:03:17,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-10 12:03:17,865 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-10 12:03:17,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5, 5] total 11 [2018-09-10 12:03:17,865 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:03:17,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:03:17,866 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:03:17,866 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:03:17,867 INFO L87 Difference]: Start difference. First operand 3246 states and 4180 transitions. Second operand 5 states. [2018-09-10 12:03:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:19,157 INFO L93 Difference]: Finished difference Result 6227 states and 8055 transitions. [2018-09-10 12:03:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 12:03:19,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2018-09-10 12:03:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:19,178 INFO L225 Difference]: With dead ends: 6227 [2018-09-10 12:03:19,178 INFO L226 Difference]: Without dead ends: 3195 [2018-09-10 12:03:19,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 920 SyntacticMatches, 10 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:03:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2018-09-10 12:03:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3170. [2018-09-10 12:03:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2018-09-10 12:03:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 3966 transitions. [2018-09-10 12:03:19,282 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 3966 transitions. Word has length 233 [2018-09-10 12:03:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:19,282 INFO L480 AbstractCegarLoop]: Abstraction has 3170 states and 3966 transitions. [2018-09-10 12:03:19,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:03:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 3966 transitions. [2018-09-10 12:03:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-10 12:03:19,290 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:19,291 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:03:19,291 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:19,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1710810776, now seen corresponding path program 1 times [2018-09-10 12:03:19,291 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:19,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:19,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:19,293 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:19,764 WARN L175 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-09-10 12:03:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 82 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:03:19,918 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:19,918 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:03:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:19,927 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:20,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 12:03:20,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:20,576 WARN L175 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-09-10 12:03:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 82 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:03:20,980 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:03:20,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 12:03:20,980 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:03:20,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:03:20,981 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:03:20,981 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:03:20,981 INFO L87 Difference]: Start difference. First operand 3170 states and 3966 transitions. Second operand 5 states. [2018-09-10 12:03:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:23,602 INFO L93 Difference]: Finished difference Result 7943 states and 9704 transitions. [2018-09-10 12:03:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:03:23,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2018-09-10 12:03:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:23,624 INFO L225 Difference]: With dead ends: 7943 [2018-09-10 12:03:23,624 INFO L226 Difference]: Without dead ends: 4578 [2018-09-10 12:03:23,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 468 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-10 12:03:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2018-09-10 12:03:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 4143. [2018-09-10 12:03:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2018-09-10 12:03:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5001 transitions. [2018-09-10 12:03:23,729 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5001 transitions. Word has length 236 [2018-09-10 12:03:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:23,730 INFO L480 AbstractCegarLoop]: Abstraction has 4143 states and 5001 transitions. [2018-09-10 12:03:23,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:03:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5001 transitions. [2018-09-10 12:03:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-09-10 12:03:23,744 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:23,744 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:03:23,744 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:23,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1444126395, now seen corresponding path program 1 times [2018-09-10 12:03:23,745 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:23,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:23,746 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 211 proven. 142 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:03:24,650 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:24,650 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:03:24,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:24,662 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:24,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 263 proven. 53 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 12:03:25,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 133 proven. 220 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:03:25,870 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:25,871 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:03:25,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:25,887 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:26,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 263 proven. 53 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-10 12:03:26,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 133 proven. 220 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:03:27,032 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:03:27,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8, 8, 8] total 26 [2018-09-10 12:03:27,033 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:03:27,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-10 12:03:27,034 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-10 12:03:27,035 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-10 12:03:27,035 INFO L87 Difference]: Start difference. First operand 4143 states and 5001 transitions. Second operand 15 states. [2018-09-10 12:03:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:31,887 INFO L93 Difference]: Finished difference Result 8803 states and 10618 transitions. [2018-09-10 12:03:31,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-10 12:03:31,888 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 321 [2018-09-10 12:03:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:31,909 INFO L225 Difference]: With dead ends: 8803 [2018-09-10 12:03:31,910 INFO L226 Difference]: Without dead ends: 4833 [2018-09-10 12:03:31,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1325 GetRequests, 1280 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=402, Invalid=1238, Unknown=0, NotChecked=0, Total=1640 [2018-09-10 12:03:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2018-09-10 12:03:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4510. [2018-09-10 12:03:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4510 states. [2018-09-10 12:03:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5188 transitions. [2018-09-10 12:03:32,027 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5188 transitions. Word has length 321 [2018-09-10 12:03:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:32,028 INFO L480 AbstractCegarLoop]: Abstraction has 4510 states and 5188 transitions. [2018-09-10 12:03:32,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-10 12:03:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5188 transitions. [2018-09-10 12:03:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-10 12:03:32,043 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:32,043 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-10 12:03:32,044 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:32,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1312541612, now seen corresponding path program 1 times [2018-09-10 12:03:32,044 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:32,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:32,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:32,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:32,045 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 225 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:32,871 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:32,871 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:03:32,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:32,879 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:32,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:33,760 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-09-10 12:03:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-09-10 12:03:33,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:34,272 WARN L175 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 12:03:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 123 proven. 175 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-09-10 12:03:34,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:03:34,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 5] total 16 [2018-09-10 12:03:34,503 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:03:34,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:03:34,504 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:03:34,504 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:03:34,504 INFO L87 Difference]: Start difference. First operand 4510 states and 5188 transitions. Second operand 5 states. [2018-09-10 12:03:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:36,241 INFO L93 Difference]: Finished difference Result 10409 states and 12180 transitions. [2018-09-10 12:03:36,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:03:36,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 346 [2018-09-10 12:03:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:36,274 INFO L225 Difference]: With dead ends: 10409 [2018-09-10 12:03:36,274 INFO L226 Difference]: Without dead ends: 6273 [2018-09-10 12:03:36,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 689 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-09-10 12:03:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2018-09-10 12:03:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 6271. [2018-09-10 12:03:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6271 states. [2018-09-10 12:03:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6271 states to 6271 states and 7054 transitions. [2018-09-10 12:03:36,444 INFO L78 Accepts]: Start accepts. Automaton has 6271 states and 7054 transitions. Word has length 346 [2018-09-10 12:03:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:36,445 INFO L480 AbstractCegarLoop]: Abstraction has 6271 states and 7054 transitions. [2018-09-10 12:03:36,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:03:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 6271 states and 7054 transitions. [2018-09-10 12:03:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-09-10 12:03:36,467 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:36,468 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:03:36,468 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:36,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1542665659, now seen corresponding path program 1 times [2018-09-10 12:03:36,469 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:36,470 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 396 proven. 74 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-09-10 12:03:37,134 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:37,134 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:03:37,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:37,145 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:37,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 569 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-09-10 12:03:37,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 396 proven. 74 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-09-10 12:03:37,899 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:37,900 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:03:37,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:37,916 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:38,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 563 proven. 8 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-09-10 12:03:38,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:39,269 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-10 12:03:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 396 proven. 74 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-09-10 12:03:39,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:03:39,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 8, 5] total 16 [2018-09-10 12:03:39,707 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:03:39,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 12:03:39,709 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 12:03:39,709 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:03:39,709 INFO L87 Difference]: Start difference. First operand 6271 states and 7054 transitions. Second operand 7 states. [2018-09-10 12:03:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:41,875 INFO L93 Difference]: Finished difference Result 12387 states and 13981 transitions. [2018-09-10 12:03:41,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 12:03:41,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 457 [2018-09-10 12:03:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:41,889 INFO L225 Difference]: With dead ends: 12387 [2018-09-10 12:03:41,890 INFO L226 Difference]: Without dead ends: 4654 [2018-09-10 12:03:41,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1848 GetRequests, 1818 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-09-10 12:03:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2018-09-10 12:03:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4486. [2018-09-10 12:03:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4486 states. [2018-09-10 12:03:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4486 states to 4486 states and 4966 transitions. [2018-09-10 12:03:41,989 INFO L78 Accepts]: Start accepts. Automaton has 4486 states and 4966 transitions. Word has length 457 [2018-09-10 12:03:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:41,990 INFO L480 AbstractCegarLoop]: Abstraction has 4486 states and 4966 transitions. [2018-09-10 12:03:41,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 12:03:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4486 states and 4966 transitions. [2018-09-10 12:03:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-09-10 12:03:42,008 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:42,008 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:03:42,008 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash 700867512, now seen corresponding path program 1 times [2018-09-10 12:03:42,009 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:42,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:42,010 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:42,562 WARN L175 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 12:03:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 536 proven. 399 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-10 12:03:43,552 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:43,552 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:03:43,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:43,560 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:43,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 773 proven. 2 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-09-10 12:03:44,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 530 proven. 74 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2018-09-10 12:03:44,689 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:44,690 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:03:44,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:44,706 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:03:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:45,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 565 proven. 210 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-09-10 12:03:45,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 241 proven. 571 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-10 12:03:46,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:03:46,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 8, 8] total 16 [2018-09-10 12:03:46,342 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:03:46,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 12:03:46,343 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 12:03:46,343 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:03:46,344 INFO L87 Difference]: Start difference. First operand 4486 states and 4966 transitions. Second operand 13 states. [2018-09-10 12:03:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:49,791 INFO L93 Difference]: Finished difference Result 8771 states and 9968 transitions. [2018-09-10 12:03:49,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 12:03:49,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 542 [2018-09-10 12:03:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:49,803 INFO L225 Difference]: With dead ends: 8771 [2018-09-10 12:03:49,803 INFO L226 Difference]: Without dead ends: 4460 [2018-09-10 12:03:49,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2198 GetRequests, 2157 SyntacticMatches, 17 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2018-09-10 12:03:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2018-09-10 12:03:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4330. [2018-09-10 12:03:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4330 states. [2018-09-10 12:03:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 4673 transitions. [2018-09-10 12:03:49,887 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 4673 transitions. Word has length 542 [2018-09-10 12:03:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:49,888 INFO L480 AbstractCegarLoop]: Abstraction has 4330 states and 4673 transitions. [2018-09-10 12:03:49,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 12:03:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 4673 transitions. [2018-09-10 12:03:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-09-10 12:03:49,897 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:49,898 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:03:49,898 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash 415197604, now seen corresponding path program 2 times [2018-09-10 12:03:49,899 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:49,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:49,900 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 562 proven. 425 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-09-10 12:03:51,358 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:51,358 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:03:51,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 12:03:51,373 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 12:03:51,556 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 12:03:51,556 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 12:03:51,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 799 proven. 2 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-09-10 12:03:51,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 556 proven. 74 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2018-09-10 12:03:52,682 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:03:52,683 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:03:52,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 12:03:52,699 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 12:03:53,139 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 12:03:53,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 12:03:53,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:03:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 784 proven. 17 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-09-10 12:03:54,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:03:54,547 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-09-10 12:03:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 235 proven. 603 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-09-10 12:03:56,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:03:56,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5, 10, 11] total 31 [2018-09-10 12:03:56,640 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:03:56,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-10 12:03:56,641 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-10 12:03:56,641 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-09-10 12:03:56,641 INFO L87 Difference]: Start difference. First operand 4330 states and 4673 transitions. Second operand 18 states. [2018-09-10 12:04:01,503 WARN L175 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-09-10 12:04:03,541 WARN L175 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-09-10 12:04:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:05,440 INFO L93 Difference]: Finished difference Result 8488 states and 9251 transitions. [2018-09-10 12:04:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-10 12:04:05,441 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 568 [2018-09-10 12:04:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:05,450 INFO L225 Difference]: With dead ends: 8488 [2018-09-10 12:04:05,450 INFO L226 Difference]: Without dead ends: 4217 [2018-09-10 12:04:05,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2337 GetRequests, 2264 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=686, Invalid=2974, Unknown=0, NotChecked=0, Total=3660 [2018-09-10 12:04:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2018-09-10 12:04:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 3674. [2018-09-10 12:04:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3674 states. [2018-09-10 12:04:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 3922 transitions. [2018-09-10 12:04:05,522 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 3922 transitions. Word has length 568 [2018-09-10 12:04:05,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:05,523 INFO L480 AbstractCegarLoop]: Abstraction has 3674 states and 3922 transitions. [2018-09-10 12:04:05,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-10 12:04:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 3922 transitions. [2018-09-10 12:04:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-09-10 12:04:05,532 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:05,532 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-09-10 12:04:05,533 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2098249972, now seen corresponding path program 1 times [2018-09-10 12:04:05,533 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:05,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 12:04:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:05,534 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 563 proven. 74 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2018-09-10 12:04:06,431 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:06,431 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:06,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:06,440 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:06,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 806 proven. 2 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-09-10 12:04:06,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 563 proven. 74 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2018-09-10 12:04:07,374 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:07,375 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:07,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:07,391 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:07,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 806 proven. 2 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-09-10 12:04:08,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 563 proven. 74 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2018-09-10 12:04:08,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:08,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 9 [2018-09-10 12:04:08,446 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:08,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 12:04:08,448 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 12:04:08,448 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:04:08,448 INFO L87 Difference]: Start difference. First operand 3674 states and 3922 transitions. Second operand 7 states. [2018-09-10 12:04:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:10,316 INFO L93 Difference]: Finished difference Result 9787 states and 11040 transitions. [2018-09-10 12:04:10,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 12:04:10,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 642 [2018-09-10 12:04:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:10,347 INFO L225 Difference]: With dead ends: 9787 [2018-09-10 12:04:10,347 INFO L226 Difference]: Without dead ends: 6276 [2018-09-10 12:04:10,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2581 GetRequests, 2567 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-10 12:04:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2018-09-10 12:04:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 5976. [2018-09-10 12:04:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5976 states. [2018-09-10 12:04:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 6412 transitions. [2018-09-10 12:04:10,511 INFO L78 Accepts]: Start accepts. Automaton has 5976 states and 6412 transitions. Word has length 642 [2018-09-10 12:04:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:10,512 INFO L480 AbstractCegarLoop]: Abstraction has 5976 states and 6412 transitions. [2018-09-10 12:04:10,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 12:04:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5976 states and 6412 transitions. [2018-09-10 12:04:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2018-09-10 12:04:10,523 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:10,524 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:10,524 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:10,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1089635279, now seen corresponding path program 1 times [2018-09-10 12:04:10,525 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:10,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:10,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:10,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:10,526 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 824 proven. 712 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2018-09-10 12:04:12,224 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:12,224 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:12,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:12,237 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:12,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 1194 proven. 2 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-09-10 12:04:12,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:13,030 WARN L175 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2018-09-10 12:04:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 812 proven. 74 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2018-09-10 12:04:13,863 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:13,863 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 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 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:13,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:13,879 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:14,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:14,914 WARN L175 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 12:04:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 1186 proven. 10 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-09-10 12:04:15,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 317 proven. 916 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2018-09-10 12:04:16,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:16,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5, 8, 8] total 28 [2018-09-10 12:04:16,941 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:16,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-10 12:04:16,943 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-10 12:04:16,944 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2018-09-10 12:04:16,944 INFO L87 Difference]: Start difference. First operand 5976 states and 6412 transitions. Second operand 17 states. [2018-09-10 12:04:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:23,859 INFO L93 Difference]: Finished difference Result 11903 states and 13098 transitions. [2018-09-10 12:04:23,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-10 12:04:23,860 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 731 [2018-09-10 12:04:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:23,883 INFO L225 Difference]: With dead ends: 11903 [2018-09-10 12:04:23,883 INFO L226 Difference]: Without dead ends: 5384 [2018-09-10 12:04:23,898 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2999 GetRequests, 2926 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1008, Invalid=3548, Unknown=0, NotChecked=0, Total=4556 [2018-09-10 12:04:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2018-09-10 12:04:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 5115. [2018-09-10 12:04:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5115 states. [2018-09-10 12:04:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 5433 transitions. [2018-09-10 12:04:24,021 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 5433 transitions. Word has length 731 [2018-09-10 12:04:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:24,022 INFO L480 AbstractCegarLoop]: Abstraction has 5115 states and 5433 transitions. [2018-09-10 12:04:24,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-10 12:04:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 5433 transitions. [2018-09-10 12:04:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 803 [2018-09-10 12:04:24,033 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:24,033 INFO L376 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:24,034 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash -807074268, now seen corresponding path program 1 times [2018-09-10 12:04:24,034 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:24,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:24,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:24,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:24,035 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:25,489 WARN L175 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-10 12:04:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 779 proven. 677 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-09-10 12:04:27,408 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:27,408 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:27,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:27,420 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:27,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 1085 proven. 2 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-09-10 12:04:28,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 772 proven. 74 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2018-09-10 12:04:28,548 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:28,548 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 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 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:28,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:28,563 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:29,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 1085 proven. 2 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-09-10 12:04:29,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1790 backedges. 772 proven. 74 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2018-09-10 12:04:29,825 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:29,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5, 5, 5] total 22 [2018-09-10 12:04:29,826 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:29,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-10 12:04:29,827 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-10 12:04:29,828 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-09-10 12:04:29,828 INFO L87 Difference]: Start difference. First operand 5115 states and 5433 transitions. Second operand 20 states. [2018-09-10 12:04:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:40,109 INFO L93 Difference]: Finished difference Result 11134 states and 11940 transitions. [2018-09-10 12:04:40,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-10 12:04:40,110 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 802 [2018-09-10 12:04:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:40,146 INFO L225 Difference]: With dead ends: 11134 [2018-09-10 12:04:40,146 INFO L226 Difference]: Without dead ends: 5879 [2018-09-10 12:04:40,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3332 GetRequests, 3249 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1852 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=987, Invalid=5175, Unknown=0, NotChecked=0, Total=6162 [2018-09-10 12:04:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2018-09-10 12:04:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 5272. [2018-09-10 12:04:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5272 states. [2018-09-10 12:04:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5272 states to 5272 states and 5556 transitions. [2018-09-10 12:04:40,264 INFO L78 Accepts]: Start accepts. Automaton has 5272 states and 5556 transitions. Word has length 802 [2018-09-10 12:04:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:40,265 INFO L480 AbstractCegarLoop]: Abstraction has 5272 states and 5556 transitions. [2018-09-10 12:04:40,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-10 12:04:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5272 states and 5556 transitions. [2018-09-10 12:04:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2018-09-10 12:04:40,281 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:40,282 INFO L376 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:04:40,282 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:40,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1348907135, now seen corresponding path program 1 times [2018-09-10 12:04:40,283 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:40,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:40,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:40,284 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:41,590 WARN L175 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-09-10 12:04:42,160 WARN L175 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-09-10 12:04:42,314 WARN L175 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-09-10 12:04:42,454 WARN L175 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2018-09-10 12:04:42,620 WARN L175 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-09-10 12:04:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3585 backedges. 1218 proven. 2201 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-09-10 12:04:46,439 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:46,439 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:46,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:46,446 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:46,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3585 backedges. 988 proven. 2 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2018-09-10 12:04:47,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3585 backedges. 988 proven. 2 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2018-09-10 12:04:48,507 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:48,508 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:48,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:48,523 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:49,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3585 backedges. 2096 proven. 6 refuted. 0 times theorem prover too weak. 1483 trivial. 0 not checked. [2018-09-10 12:04:51,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3585 backedges. 1573 proven. 221 refuted. 0 times theorem prover too weak. 1791 trivial. 0 not checked. [2018-09-10 12:04:52,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:52,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 5, 5, 7, 8] total 50 [2018-09-10 12:04:52,166 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:52,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-10 12:04:52,168 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-10 12:04:52,169 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2225, Unknown=0, NotChecked=0, Total=2450 [2018-09-10 12:04:52,169 INFO L87 Difference]: Start difference. First operand 5272 states and 5556 transitions. Second operand 37 states. [2018-09-10 12:04:54,150 WARN L175 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2018-09-10 12:04:56,183 WARN L175 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2018-09-10 12:04:57,145 WARN L175 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2018-09-10 12:04:57,475 WARN L175 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2018-09-10 12:04:57,699 WARN L175 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2018-09-10 12:04:57,899 WARN L175 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 34 [2018-09-10 12:05:00,689 WARN L175 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-09-10 12:05:02,932 WARN L175 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-09-10 12:05:03,465 WARN L175 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 29 [2018-09-10 12:05:04,371 WARN L175 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2018-09-10 12:05:04,647 WARN L175 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-09-10 12:05:06,764 WARN L175 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2018-09-10 12:05:07,118 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-09-10 12:05:08,446 WARN L175 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2018-09-10 12:05:08,987 WARN L175 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2018-09-10 12:05:09,854 WARN L175 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2018-09-10 12:05:10,410 WARN L175 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 27 [2018-09-10 12:05:12,164 WARN L175 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2018-09-10 12:05:13,410 WARN L175 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-09-10 12:05:13,646 WARN L175 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-09-10 12:05:13,875 WARN L175 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-09-10 12:05:14,922 WARN L175 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2018-09-10 12:05:16,927 WARN L175 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 33 [2018-09-10 12:05:18,252 WARN L175 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-09-10 12:05:18,622 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 26 [2018-09-10 12:05:20,056 WARN L175 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 30 [2018-09-10 12:05:20,558 WARN L175 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-10 12:05:23,622 WARN L175 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2018-09-10 12:05:24,415 WARN L175 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2018-09-10 12:05:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:25,022 INFO L93 Difference]: Finished difference Result 12247 states and 13590 transitions. [2018-09-10 12:05:25,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-10 12:05:25,023 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1059 [2018-09-10 12:05:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:25,048 INFO L225 Difference]: With dead ends: 12247 [2018-09-10 12:05:25,048 INFO L226 Difference]: Without dead ends: 6944 [2018-09-10 12:05:25,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4425 GetRequests, 4262 SyntacticMatches, 7 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7792 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=3337, Invalid=21469, Unknown=0, NotChecked=0, Total=24806 [2018-09-10 12:05:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6944 states. [2018-09-10 12:05:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6944 to 5304. [2018-09-10 12:05:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5304 states. [2018-09-10 12:05:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 5453 transitions. [2018-09-10 12:05:25,194 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 5453 transitions. Word has length 1059 [2018-09-10 12:05:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:25,195 INFO L480 AbstractCegarLoop]: Abstraction has 5304 states and 5453 transitions. [2018-09-10 12:05:25,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-10 12:05:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 5453 transitions. [2018-09-10 12:05:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-09-10 12:05:25,214 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:05:25,215 INFO L376 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:05:25,216 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:05:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1644562657, now seen corresponding path program 1 times [2018-09-10 12:05:25,216 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:05:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:25,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:25,217 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:05:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 1722 proven. 265 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2018-09-10 12:05:26,447 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:26,447 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:05:26,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:26,458 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:26,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 2245 proven. 6 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2018-09-10 12:05:27,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 1722 proven. 269 refuted. 0 times theorem prover too weak. 1791 trivial. 0 not checked. [2018-09-10 12:05:28,349 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:28,349 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 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 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:05:28,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:28,369 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:29,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 2245 proven. 6 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2018-09-10 12:05:29,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 1722 proven. 269 refuted. 0 times theorem prover too weak. 1791 trivial. 0 not checked. [2018-09-10 12:05:30,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:05:30,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8, 7, 8] total 14 [2018-09-10 12:05:30,519 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:05:30,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:05:30,520 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:05:30,521 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-09-10 12:05:30,521 INFO L87 Difference]: Start difference. First operand 5304 states and 5453 transitions. Second operand 9 states. [2018-09-10 12:05:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:33,313 INFO L93 Difference]: Finished difference Result 11541 states and 11912 transitions. [2018-09-10 12:05:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 12:05:33,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1107 [2018-09-10 12:05:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:33,326 INFO L225 Difference]: With dead ends: 11541 [2018-09-10 12:05:33,326 INFO L226 Difference]: Without dead ends: 6428 [2018-09-10 12:05:33,332 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4453 GetRequests, 4428 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-09-10 12:05:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6428 states. [2018-09-10 12:05:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6428 to 5871. [2018-09-10 12:05:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5871 states. [2018-09-10 12:05:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5871 states to 5871 states and 6035 transitions. [2018-09-10 12:05:33,436 INFO L78 Accepts]: Start accepts. Automaton has 5871 states and 6035 transitions. Word has length 1107 [2018-09-10 12:05:33,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:33,438 INFO L480 AbstractCegarLoop]: Abstraction has 5871 states and 6035 transitions. [2018-09-10 12:05:33,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:05:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5871 states and 6035 transitions. [2018-09-10 12:05:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1527 [2018-09-10 12:05:33,462 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:05:33,463 INFO L376 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:05:33,463 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:05:33,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1753454404, now seen corresponding path program 1 times [2018-09-10 12:05:33,464 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:05:33,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:33,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:33,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:33,465 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:05:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 6074 trivial. 0 not checked. [2018-09-10 12:05:35,048 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:05:35,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:05:35,049 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:05:35,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:05:35,049 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:05:35,049 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:05:35,050 INFO L87 Difference]: Start difference. First operand 5871 states and 6035 transitions. Second operand 4 states. [2018-09-10 12:05:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:36,235 INFO L93 Difference]: Finished difference Result 12440 states and 12801 transitions. [2018-09-10 12:05:36,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:05:36,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1526 [2018-09-10 12:05:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:36,237 INFO L225 Difference]: With dead ends: 12440 [2018-09-10 12:05:36,238 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 12:05:36,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:05:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 12:05:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 12:05:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 12:05:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 12:05:36,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1526 [2018-09-10 12:05:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:36,252 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 12:05:36,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:05:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 12:05:36,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 12:05:36,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 12:05:36,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:36,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:36,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:36,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:37,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:37,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:37,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:38,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:38,163 WARN L175 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 670 DAG size of output: 554 [2018-09-10 12:05:38,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:38,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:38,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:39,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:39,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:39,651 WARN L175 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 670 DAG size of output: 554 [2018-09-10 12:05:39,787 WARN L175 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 15 [2018-09-10 12:05:42,863 WARN L175 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 335 DAG size of output: 116 [2018-09-10 12:05:47,860 WARN L175 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 556 DAG size of output: 106 [2018-09-10 12:05:54,411 WARN L175 SmtUtils]: Spent 6.55 s on a formula simplification. DAG size of input: 556 DAG size of output: 106 [2018-09-10 12:05:54,414 INFO L426 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-09-10 12:05:54,415 INFO L426 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 12:05:54,416 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 12:05:54,417 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 12:05:54,418 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 12:05:54,418 INFO L426 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-09-10 12:05:54,418 INFO L426 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-09-10 12:05:54,418 INFO L426 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-09-10 12:05:54,418 INFO L426 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-09-10 12:05:54,418 INFO L426 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-09-10 12:05:54,418 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,418 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,418 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,419 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,420 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,420 INFO L426 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-09-10 12:05:54,420 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 12:05:54,420 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 12:05:54,420 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 12:05:54,420 INFO L426 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-09-10 12:05:54,420 INFO L426 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-09-10 12:05:54,420 INFO L426 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-09-10 12:05:54,420 INFO L426 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-09-10 12:05:54,421 INFO L426 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-09-10 12:05:54,421 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,421 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,421 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,421 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-09-10 12:05:54,421 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 12:05:54,421 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 12:05:54,421 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 12:05:54,421 INFO L426 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 12:05:54,422 INFO L426 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-09-10 12:05:54,423 INFO L426 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-09-10 12:05:54,423 INFO L426 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-09-10 12:05:54,423 INFO L426 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-09-10 12:05:54,423 INFO L426 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-09-10 12:05:54,423 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,423 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,423 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,423 INFO L426 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-09-10 12:05:54,423 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,424 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 12:05:54,425 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 12:05:54,425 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 12:05:54,425 INFO L426 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-09-10 12:05:54,425 INFO L426 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-09-10 12:05:54,425 INFO L426 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-09-10 12:05:54,425 INFO L426 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-09-10 12:05:54,425 INFO L426 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-09-10 12:05:54,425 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,425 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,426 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,426 INFO L426 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-09-10 12:05:54,426 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-09-10 12:05:54,426 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 12:05:54,426 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 12:05:54,426 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 12:05:54,426 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-09-10 12:05:54,426 INFO L426 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-09-10 12:05:54,426 INFO L426 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-09-10 12:05:54,427 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,427 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,427 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,427 INFO L426 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-09-10 12:05:54,428 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 20 872) 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__a15~0)| 6)) (.cse21 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 10)) (.cse15 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|)) (.cse16 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)|)) (.cse17 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|)) (.cse26 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|))) (let ((.cse0 (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (.cse14 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 8))) (.cse13 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 12849)) (.cse22 (and .cse15 (and .cse16 .cse17 .cse26))) (.cse11 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 81)) (.cse8 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8))) (.cse23 (< 76 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|)) (.cse19 (< 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (.cse4 (and .cse15 .cse16 .cse17 .cse26)) (.cse9 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1))) (.cse20 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 6)) (.cse5 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 7))) (.cse25 (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (.cse10 (not .cse21)) (.cse18 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10)) (.cse1 (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49))) (.cse2 (< 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|)) (.cse6 (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43) 0)) (.cse24 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) (.cse7 (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 43))) (.cse12 (not .cse3))) (and (or (or .cse0 (or .cse1 .cse2 .cse3)) .cse4) (or .cse5 .cse6 .cse7) (or .cse8 .cse4 .cse7 .cse9) (or (or .cse10 .cse2 .cse3 .cse9) .cse4) (or .cse0 .cse4 .cse11 .cse12 .cse9) (or .cse8 .cse13 .cse14 (< 73282 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|) (and .cse15 .cse16 .cse17 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 8)) .cse9) (or .cse10 .cse18 .cse12) (or .cse4 .cse14 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 9)) .cse9) (or .cse10 .cse5 .cse18) (or .cse10 .cse4 .cse3 (< 11 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|) .cse9) (or .cse13 .cse19 .cse4 .cse9) (or .cse20 .cse4 .cse21 .cse2 .cse3) (or .cse22 (or .cse11 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7)) .cse9)) (or .cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7)) (or .cse22 (or .cse11 (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 9) .cse3 .cse9)) (or .cse20 .cse8 .cse4 .cse23 .cse21 .cse9) (or .cse23 .cse19 (<= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 11) .cse12 .cse4 .cse9) (or .cse4 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 5)) .cse9) (or .cse20 .cse12 (and .cse24 .cse25)) (or .cse20 .cse5 .cse25) (or .cse10 (and .cse18 .cse24 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|)) .cse1 .cse2 .cse3) (or (and .cse6 .cse24) .cse7 .cse12)))) [2018-09-10 12:05:54,428 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 12:05:54,428 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 12:05:54,428 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 12:05:54,428 INFO L426 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-09-10 12:05:54,428 INFO L426 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-09-10 12:05:54,428 INFO L426 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-09-10 12:05:54,428 INFO L426 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-09-10 12:05:54,428 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-09-10 12:05:54,429 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-09-10 12:05:54,430 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,431 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,431 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,431 INFO L426 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-09-10 12:05:54,431 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 12:05:54,431 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 12:05:54,431 INFO L426 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-09-10 12:05:54,431 INFO L426 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-09-10 12:05:54,431 INFO L426 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-09-10 12:05:54,432 INFO L426 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-09-10 12:05:54,433 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,434 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-09-10 12:05:54,435 INFO L426 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-09-10 12:05:54,436 INFO L426 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-09-10 12:05:54,437 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-09-10 12:05:54,438 INFO L426 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:05:54,439 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|)) [2018-09-10 12:05:54,439 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:05:54,440 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:05:54,440 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0) (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0) (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) [2018-09-10 12:05:54,440 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 12:05:54,440 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:05:54,440 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8)) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1))) [2018-09-10 12:05:54,440 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-09-10 12:05:54,440 INFO L422 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)) (.cse13 (not (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (.cse5 (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)))) (let ((.cse3 (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) (.cse6 (and .cse1 .cse13 .cse5)) (.cse12 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0))) (let ((.cse0 (< 80 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse4 (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43) 0)) (.cse10 (and .cse6 .cse12)) (.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 76)) (.cse9 (<= 12849 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse11 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282)) (.cse8 (let ((.cse15 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)|)))) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6) (or (not (= 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|)) .cse15 (not (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|))) (and .cse1 .cse3 (or (<= 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 42)) .cse15 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|)) (not (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|))))))) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10)) (.cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 6))) (or (and .cse0 (and .cse1 .cse2)) (and .cse3 .cse4) (and .cse3 .cse5) (and (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0) .cse0 .cse6) (and (< 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0) (and .cse7 .cse8)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8)) (and (and .cse1 (not .cse3) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) .cse9) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) (and .cse10 .cse9 .cse11) (and .cse12 (and .cse1 .cse4)) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 9) (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0) .cse6) (and .cse10 .cse7) (and .cse13 .cse14 .cse5) (and .cse1 .cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1)) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) (and (and .cse1 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)) (<= 81 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (and .cse1 (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) .cse14) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7) (and .cse9 .cse11 .cse8) (and .cse1 .cse2 .cse14))))) [2018-09-10 12:05:54,441 INFO L426 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-09-10 12:05:54,441 INFO L426 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-09-10 12:05:54,441 INFO L426 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-09-10 12:05:54,441 INFO L422 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse1 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)) (.cse13 (not (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0))) (.cse5 (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)))) (let ((.cse3 (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) (.cse6 (and .cse1 .cse13 .cse5)) (.cse12 (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0))) (let ((.cse0 (< 80 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse4 (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43) 0)) (.cse10 (and .cse6 .cse12)) (.cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 76)) (.cse9 (<= 12849 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse11 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282)) (.cse8 (let ((.cse15 (not (= 1 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)|)))) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6) (or (not (= 5 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|)) .cse15 (not (= 6 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|))) (and .cse1 .cse3 (or (<= 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 42)) .cse15 (not (= 8 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|)) (not (= 10 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|))))))) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10)) (.cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 6))) (or (and .cse0 (and .cse1 .cse2)) (and .cse3 .cse4) (and .cse3 .cse5) (and (<= 9 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0) .cse0 .cse6) (and (< 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0) (and .cse7 .cse8)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8)) (and (and .cse1 (not .cse3) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) .cse9) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) (and .cse10 .cse9 .cse11) (and .cse12 (and .cse1 .cse4)) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 9) (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0) .cse6) (and .cse10 .cse7) (and .cse13 .cse14 .cse5) (and .cse1 .cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1)) (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) (and (and .cse1 (= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)) (<= 81 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (and .cse1 (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) .cse14) (< |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7) (and .cse9 .cse11 .cse8) (and .cse1 .cse2 .cse14))))) [2018-09-10 12:05:54,441 INFO L426 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-09-10 12:05:54,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 12:05:54 BoogieIcfgContainer [2018-09-10 12:05:54,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 12:05:54,479 INFO L168 Benchmark]: Toolchain (without parser) took 183364.35 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-10 12:05:54,480 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 12:05:54,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.35 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-09-10 12:05:54,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-10 12:05:54,481 INFO L168 Benchmark]: Boogie Preprocessor took 264.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -862.7 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:05:54,485 INFO L168 Benchmark]: RCFGBuilder took 3628.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 137.2 MB). Peak memory consumption was 137.2 MB. Max. memory is 7.1 GB. [2018-09-10 12:05:54,486 INFO L168 Benchmark]: TraceAbstraction took 178483.29 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-10 12:05:54,495 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 841.35 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 138.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 264.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -862.7 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3628.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 137.2 MB). Peak memory consumption was 137.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 178483.29 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 127]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((80 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10) || (6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0)) || (6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 && !(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21))) || ((9 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 && 80 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && !(10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) && !(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21))) || (11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 76 && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6 && ((!(5 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15)) || !(1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24))) || !(6 == \old(__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__a24 && 6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) && (((0 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) + 42 || !(1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24))) || !(8 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15))) || !(10 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21))))) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) == 8)) || (((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && !(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 7) && 12849 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || 0 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) + 49) || (((((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && !(10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) && !(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) && 8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) && 12849 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282)) || (8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9 && 8 == __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__a24 && !(10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) && !(6 == __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__a24 && !(10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) && !(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21)) && 8 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 76)) || ((!(10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 6) && !(6 == __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__a24 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11)) || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24) == 1)) || 7 < \old(__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__a24 && 7 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) && 81 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && 5 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 6)) || \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) < 7) || ((12849 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6 && ((!(5 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15)) || !(1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24))) || !(6 == \old(__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__a24 && 6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) && (((0 <= \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) + 42 || !(1 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24))) || !(8 == \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15))) || !(10 == \old(__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__a24 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 178.3s OverallTime, 17 OverallIterations, 12 TraceHistogramMax, 97.6s AutomataDifference, 0.0s DeadEndRemovalTime, 18.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1539 SDtfs, 45474 SDslu, 3576 SDs, 0 SdLazy, 52996 SolverSat, 6524 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28499 GetRequests, 27867 SyntacticMatches, 94 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12930 ImplicationChecksByTransitivity, 38.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6271occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 5313 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 384 PreInvPairs, 548 NumberOfFragments, 1238 HoareAnnotationTreeSize, 384 FomulaSimplifications, 519076 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 376549 FormulaSimplificationTreeSizeReductionInter, 14.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 23021 NumberOfCodeBlocks, 23021 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 36876 ConstructedInterpolants, 12 QuantifiedInterpolants, 119084113 SizeOfPredicates, 66 NumberOfNonLiveVariables, 20992 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 65 InterpolantComputations, 7 PerfectInterpolantSequences, 78859/88667 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/Problem14_label24_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_12-05-54-532.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label24_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_12-05-54-532.csv Received shutdown request...