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/Problem03_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:23:46,239 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:23:46,241 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:23:46,253 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:23:46,253 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:23:46,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:23:46,256 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:23:46,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:23:46,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:23:46,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:23:46,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:23:46,261 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:23:46,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:23:46,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:23:46,265 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:23:46,265 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:23:46,266 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:23:46,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:23:46,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:23:46,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:23:46,273 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:23:46,274 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:23:46,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:23:46,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:23:46,277 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:23:46,278 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:23:46,279 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:23:46,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:23:46,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:23:46,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:23:46,284 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:23:46,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:23:46,285 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:23:46,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:23:46,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:23:46,289 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:23:46,289 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:23:46,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:23:46,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:23:46,321 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:23:46,322 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:23:46,322 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:23:46,322 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:23:46,322 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:23:46,322 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:23:46,323 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:23:46,323 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:23:46,323 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:23:46,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:23:46,324 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:23:46,324 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:23:46,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:23:46,325 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:23:46,325 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:23:46,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:23:46,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:23:46,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:23:46,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:23:46,326 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:23:46,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:23:46,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:23:46,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:23:46,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:23:46,328 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:23:46,329 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:23:46,329 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:23:46,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:23:46,329 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:23:46,329 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:23:46,330 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:23:46,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:23:46,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:23:46,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:23:46,426 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:23:46,426 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:23:46,427 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-09-10 10:23:46,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9fc19fc/fb2bd534a7df491bb423e3a9102386e9/FLAGb23c343b0 [2018-09-10 10:23:47,185 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:23:47,186 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-09-10 10:23:47,213 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9fc19fc/fb2bd534a7df491bb423e3a9102386e9/FLAGb23c343b0 [2018-09-10 10:23:47,235 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9fc19fc/fb2bd534a7df491bb423e3a9102386e9 [2018-09-10 10:23:47,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:23:47,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:23:47,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:23:47,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:23:47,263 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:23:47,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56add989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:47, skipping insertion in model container [2018-09-10 10:23:47,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:23:47" (1/1) ... [2018-09-10 10:23:47,573 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:23:48,154 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:23:48,178 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:23:48,443 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:23:48,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48 WrapperNode [2018-09-10 10:23:48,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:23:48,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:23:48,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:23:48,507 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:23:48,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... [2018-09-10 10:23:48,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... [2018-09-10 10:23:48,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:23:48,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:23:48,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:23:48,651 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:23:48,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... [2018-09-10 10:23:48,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... [2018-09-10 10:23:48,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... [2018-09-10 10:23:48,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... [2018-09-10 10:23:48,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... [2018-09-10 10:23:48,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... [2018-09-10 10:23:48,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... [2018-09-10 10:23:49,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:23:49,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:23:49,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:23:49,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:23:49,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:23:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:23:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:23:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 10:23:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-10 10:23:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:23:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:23:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:23:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:23:54,065 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:23:54,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:54 BoogieIcfgContainer [2018-09-10 10:23:54,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:23:54,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:23:54,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:23:54,071 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:23:54,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:23:47" (1/3) ... [2018-09-10 10:23:54,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782f931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:54, skipping insertion in model container [2018-09-10 10:23:54,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:48" (2/3) ... [2018-09-10 10:23:54,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782f931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:54, skipping insertion in model container [2018-09-10 10:23:54,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:54" (3/3) ... [2018-09-10 10:23:54,075 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label11_true-unreach-call.c [2018-09-10 10:23:54,085 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:23:54,095 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:23:54,150 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:23:54,150 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:23:54,150 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:23:54,150 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:23:54,151 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:23:54,151 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:23:54,151 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:23:54,151 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:23:54,151 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:23:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-10 10:23:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-10 10:23:54,203 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:54,205 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:54,207 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1813715753, now seen corresponding path program 1 times [2018-09-10 10:23:54,214 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:54,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:54,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:54,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:54,268 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:55,082 WARN L175 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:23:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:55,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:55,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:55,302 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:55,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:55,327 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:55,328 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:55,331 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2018-09-10 10:23:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:57,546 INFO L93 Difference]: Finished difference Result 838 states and 1479 transitions. [2018-09-10 10:23:57,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:57,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-09-10 10:23:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:57,578 INFO L225 Difference]: With dead ends: 838 [2018-09-10 10:23:57,578 INFO L226 Difference]: Without dead ends: 524 [2018-09-10 10:23:57,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-09-10 10:23:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 522. [2018-09-10 10:23:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-10 10:23:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 890 transitions. [2018-09-10 10:23:57,681 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 890 transitions. Word has length 200 [2018-09-10 10:23:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:57,683 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 890 transitions. [2018-09-10 10:23:57,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 890 transitions. [2018-09-10 10:23:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-10 10:23:57,698 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:57,699 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:23:57,699 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:23:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash 86742928, now seen corresponding path program 1 times [2018-09-10 10:23:57,700 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:57,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:57,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:57,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:57,703 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:58,132 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:58,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:23:58,133 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:58,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:23:58,135 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:23:58,135 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:23:58,137 INFO L87 Difference]: Start difference. First operand 522 states and 890 transitions. Second operand 6 states. [2018-09-10 10:24:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:01,764 INFO L93 Difference]: Finished difference Result 1271 states and 2186 transitions. [2018-09-10 10:24:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:24:01,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2018-09-10 10:24:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:01,771 INFO L225 Difference]: With dead ends: 1271 [2018-09-10 10:24:01,771 INFO L226 Difference]: Without dead ends: 755 [2018-09-10 10:24:01,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:24:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-09-10 10:24:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 739. [2018-09-10 10:24:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-09-10 10:24:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1100 transitions. [2018-09-10 10:24:01,816 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1100 transitions. Word has length 210 [2018-09-10 10:24:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:01,817 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 1100 transitions. [2018-09-10 10:24:01,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:24:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1100 transitions. [2018-09-10 10:24:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-10 10:24:01,823 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:01,823 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:01,824 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:01,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1009483949, now seen corresponding path program 1 times [2018-09-10 10:24:01,824 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:01,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:01,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:01,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:01,826 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:02,113 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:24:02,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:24:02,113 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:02,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:24:02,114 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:24:02,114 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:24:02,115 INFO L87 Difference]: Start difference. First operand 739 states and 1100 transitions. Second operand 3 states. [2018-09-10 10:24:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:04,538 INFO L93 Difference]: Finished difference Result 2117 states and 3231 transitions. [2018-09-10 10:24:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:24:04,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-09-10 10:24:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:04,551 INFO L225 Difference]: With dead ends: 2117 [2018-09-10 10:24:04,551 INFO L226 Difference]: Without dead ends: 1384 [2018-09-10 10:24:04,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:24:04,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-09-10 10:24:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1382. [2018-09-10 10:24:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2018-09-10 10:24:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1971 transitions. [2018-09-10 10:24:04,632 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1971 transitions. Word has length 213 [2018-09-10 10:24:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:04,633 INFO L480 AbstractCegarLoop]: Abstraction has 1382 states and 1971 transitions. [2018-09-10 10:24:04,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:24:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1971 transitions. [2018-09-10 10:24:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-10 10:24:04,643 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:04,644 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:04,644 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1768146569, now seen corresponding path program 1 times [2018-09-10 10:24:04,644 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:04,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:04,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:04,646 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:04,979 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:24:04,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:24:04,979 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:04,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:24:04,980 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:24:04,980 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:24:04,981 INFO L87 Difference]: Start difference. First operand 1382 states and 1971 transitions. Second operand 3 states. [2018-09-10 10:24:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:07,014 INFO L93 Difference]: Finished difference Result 4032 states and 5930 transitions. [2018-09-10 10:24:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:24:07,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-09-10 10:24:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:07,036 INFO L225 Difference]: With dead ends: 4032 [2018-09-10 10:24:07,036 INFO L226 Difference]: Without dead ends: 2656 [2018-09-10 10:24:07,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:24:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2018-09-10 10:24:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2650. [2018-09-10 10:24:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2018-09-10 10:24:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3715 transitions. [2018-09-10 10:24:07,131 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3715 transitions. Word has length 215 [2018-09-10 10:24:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:07,132 INFO L480 AbstractCegarLoop]: Abstraction has 2650 states and 3715 transitions. [2018-09-10 10:24:07,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:24:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3715 transitions. [2018-09-10 10:24:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-10 10:24:07,148 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:07,149 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:07,149 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash -421130013, now seen corresponding path program 1 times [2018-09-10 10:24:07,149 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:07,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:07,151 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:07,467 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:24:07,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:24:07,468 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:07,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:24:07,469 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:24:07,469 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:24:07,469 INFO L87 Difference]: Start difference. First operand 2650 states and 3715 transitions. Second operand 6 states. [2018-09-10 10:24:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:10,147 INFO L93 Difference]: Finished difference Result 5619 states and 8089 transitions. [2018-09-10 10:24:10,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:24:10,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2018-09-10 10:24:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:10,173 INFO L225 Difference]: With dead ends: 5619 [2018-09-10 10:24:10,173 INFO L226 Difference]: Without dead ends: 2975 [2018-09-10 10:24:10,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:24:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2018-09-10 10:24:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2893. [2018-09-10 10:24:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2018-09-10 10:24:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 3847 transitions. [2018-09-10 10:24:10,268 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 3847 transitions. Word has length 259 [2018-09-10 10:24:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:10,268 INFO L480 AbstractCegarLoop]: Abstraction has 2893 states and 3847 transitions. [2018-09-10 10:24:10,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:24:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 3847 transitions. [2018-09-10 10:24:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-10 10:24:10,281 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:10,281 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:10,281 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1711761631, now seen corresponding path program 1 times [2018-09-10 10:24:10,282 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:10,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:10,283 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:10,876 WARN L175 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:24:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 77 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:11,126 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:11,126 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:11,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:11,145 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:11,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:11,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:12,021 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:24:12,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:24:12,022 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:12,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:24:12,022 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:24:12,022 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:24:12,023 INFO L87 Difference]: Start difference. First operand 2893 states and 3847 transitions. Second operand 3 states. [2018-09-10 10:24:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:15,607 INFO L93 Difference]: Finished difference Result 8528 states and 11594 transitions. [2018-09-10 10:24:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:24:15,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2018-09-10 10:24:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:15,639 INFO L225 Difference]: With dead ends: 8528 [2018-09-10 10:24:15,639 INFO L226 Difference]: Without dead ends: 5641 [2018-09-10 10:24:15,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 542 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:24:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2018-09-10 10:24:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5518. [2018-09-10 10:24:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5518 states. [2018-09-10 10:24:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5518 states to 5518 states and 7394 transitions. [2018-09-10 10:24:15,781 INFO L78 Accepts]: Start accepts. Automaton has 5518 states and 7394 transitions. Word has length 272 [2018-09-10 10:24:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:15,781 INFO L480 AbstractCegarLoop]: Abstraction has 5518 states and 7394 transitions. [2018-09-10 10:24:15,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:24:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5518 states and 7394 transitions. [2018-09-10 10:24:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-10 10:24:15,805 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:15,805 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:15,806 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:15,806 INFO L82 PathProgramCache]: Analyzing trace with hash 472640192, now seen corresponding path program 1 times [2018-09-10 10:24:15,806 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:15,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:15,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:15,811 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 81 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-10 10:24:16,382 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:16,382 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:16,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:16,400 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:16,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:16,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:17,277 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:17,277 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:24:17,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:17,304 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:17,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:18,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:18,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:24:18,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-10 10:24:18,675 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:24:18,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:24:18,676 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:24:18,677 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:24:18,677 INFO L87 Difference]: Start difference. First operand 5518 states and 7394 transitions. Second operand 9 states. [2018-09-10 10:24:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:22,310 INFO L93 Difference]: Finished difference Result 11382 states and 15537 transitions. [2018-09-10 10:24:22,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-10 10:24:22,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 276 [2018-09-10 10:24:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:22,336 INFO L225 Difference]: With dead ends: 11382 [2018-09-10 10:24:22,337 INFO L226 Difference]: Without dead ends: 5870 [2018-09-10 10:24:22,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1122 GetRequests, 1099 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-10 10:24:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5870 states. [2018-09-10 10:24:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5870 to 5535. [2018-09-10 10:24:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5535 states. [2018-09-10 10:24:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 6901 transitions. [2018-09-10 10:24:22,501 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 6901 transitions. Word has length 276 [2018-09-10 10:24:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:22,501 INFO L480 AbstractCegarLoop]: Abstraction has 5535 states and 6901 transitions. [2018-09-10 10:24:22,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:24:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 6901 transitions. [2018-09-10 10:24:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-10 10:24:22,520 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:22,520 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:22,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1691430765, now seen corresponding path program 1 times [2018-09-10 10:24:22,521 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:22,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:22,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:22,523 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:23,086 WARN L175 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:24:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:23,165 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:24:23,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-10 10:24:23,166 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:23,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:24:23,167 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:24:23,167 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:24:23,167 INFO L87 Difference]: Start difference. First operand 5535 states and 6901 transitions. Second operand 7 states. [2018-09-10 10:24:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:27,312 INFO L93 Difference]: Finished difference Result 21290 states and 27527 transitions. [2018-09-10 10:24:27,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-10 10:24:27,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 278 [2018-09-10 10:24:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:27,392 INFO L225 Difference]: With dead ends: 21290 [2018-09-10 10:24:27,392 INFO L226 Difference]: Without dead ends: 15761 [2018-09-10 10:24:27,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:24:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15761 states. [2018-09-10 10:24:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15761 to 14228. [2018-09-10 10:24:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14228 states. [2018-09-10 10:24:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14228 states to 14228 states and 17588 transitions. [2018-09-10 10:24:27,909 INFO L78 Accepts]: Start accepts. Automaton has 14228 states and 17588 transitions. Word has length 278 [2018-09-10 10:24:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:27,909 INFO L480 AbstractCegarLoop]: Abstraction has 14228 states and 17588 transitions. [2018-09-10 10:24:27,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:24:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14228 states and 17588 transitions. [2018-09-10 10:24:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-10 10:24:27,945 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:27,945 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:27,946 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1637293847, now seen corresponding path program 1 times [2018-09-10 10:24:27,946 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:27,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:27,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:27,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:27,947 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:28,576 WARN L175 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:24:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:28,835 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:28,835 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:28,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:28,843 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:29,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:29,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:24:29,962 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:24:29,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-09-10 10:24:29,963 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:29,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:24:29,964 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:24:29,964 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:24:29,965 INFO L87 Difference]: Start difference. First operand 14228 states and 17588 transitions. Second operand 3 states. [2018-09-10 10:24:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:31,987 INFO L93 Difference]: Finished difference Result 37775 states and 46925 transitions. [2018-09-10 10:24:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:24:31,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2018-09-10 10:24:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:32,061 INFO L225 Difference]: With dead ends: 37775 [2018-09-10 10:24:32,062 INFO L226 Difference]: Without dead ends: 23563 [2018-09-10 10:24:32,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 580 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:24:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23563 states. [2018-09-10 10:24:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23563 to 23531. [2018-09-10 10:24:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23531 states. [2018-09-10 10:24:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23531 states to 23531 states and 28882 transitions. [2018-09-10 10:24:32,566 INFO L78 Accepts]: Start accepts. Automaton has 23531 states and 28882 transitions. Word has length 291 [2018-09-10 10:24:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:32,567 INFO L480 AbstractCegarLoop]: Abstraction has 23531 states and 28882 transitions. [2018-09-10 10:24:32,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:24:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 23531 states and 28882 transitions. [2018-09-10 10:24:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-09-10 10:24:32,628 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:32,628 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:32,628 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash 528438227, now seen corresponding path program 1 times [2018-09-10 10:24:32,629 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:32,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:32,630 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:33,484 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:33,484 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:33,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:33,495 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:33,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-10 10:24:33,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 120 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:24:33,918 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:24:33,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 7 [2018-09-10 10:24:33,919 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:33,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:24:33,919 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:24:33,919 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:24:33,920 INFO L87 Difference]: Start difference. First operand 23531 states and 28882 transitions. Second operand 5 states. [2018-09-10 10:24:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:36,290 INFO L93 Difference]: Finished difference Result 47767 states and 59648 transitions. [2018-09-10 10:24:36,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:24:36,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 326 [2018-09-10 10:24:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:36,370 INFO L225 Difference]: With dead ends: 47767 [2018-09-10 10:24:36,370 INFO L226 Difference]: Without dead ends: 24242 [2018-09-10 10:24:36,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:24:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24242 states. [2018-09-10 10:24:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24242 to 23522. [2018-09-10 10:24:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23522 states. [2018-09-10 10:24:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23522 states to 23522 states and 28248 transitions. [2018-09-10 10:24:36,864 INFO L78 Accepts]: Start accepts. Automaton has 23522 states and 28248 transitions. Word has length 326 [2018-09-10 10:24:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:36,864 INFO L480 AbstractCegarLoop]: Abstraction has 23522 states and 28248 transitions. [2018-09-10 10:24:36,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:24:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 23522 states and 28248 transitions. [2018-09-10 10:24:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-09-10 10:24:36,899 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:36,900 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:36,900 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1946588215, now seen corresponding path program 1 times [2018-09-10 10:24:36,901 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:36,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:36,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:36,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:36,902 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:37,185 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-09-10 10:24:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 142 proven. 37 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-10 10:24:37,640 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:37,640 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:37,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:37,817 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:38,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 154 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-10 10:24:38,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 142 proven. 37 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-10 10:24:38,392 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:38,392 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 10:24:38,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:38,412 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:39,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 154 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-10 10:24:39,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 142 proven. 37 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-10 10:24:39,265 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:24:39,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 10:24:39,266 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:24:39,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:24:39,267 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:24:39,267 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:24:39,268 INFO L87 Difference]: Start difference. First operand 23522 states and 28248 transitions. Second operand 9 states. [2018-09-10 10:24:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:43,253 INFO L93 Difference]: Finished difference Result 50816 states and 63248 transitions. [2018-09-10 10:24:43,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 10:24:43,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 333 [2018-09-10 10:24:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:43,339 INFO L225 Difference]: With dead ends: 50816 [2018-09-10 10:24:43,339 INFO L226 Difference]: Without dead ends: 27310 [2018-09-10 10:24:43,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1354 GetRequests, 1332 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:24:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27310 states. [2018-09-10 10:24:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27310 to 26326. [2018-09-10 10:24:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26326 states. [2018-09-10 10:24:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26326 states to 26326 states and 32334 transitions. [2018-09-10 10:24:43,907 INFO L78 Accepts]: Start accepts. Automaton has 26326 states and 32334 transitions. Word has length 333 [2018-09-10 10:24:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:43,908 INFO L480 AbstractCegarLoop]: Abstraction has 26326 states and 32334 transitions. [2018-09-10 10:24:43,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:24:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 26326 states and 32334 transitions. [2018-09-10 10:24:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-09-10 10:24:43,958 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:43,958 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:43,958 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:43,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1250883906, now seen corresponding path program 1 times [2018-09-10 10:24:43,959 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:43,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:43,961 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:44,361 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:44,361 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:44,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:44,369 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:44,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:44,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:44,894 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:44,894 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:24:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:44,912 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:45,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:45,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:45,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:24:45,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 6, 6] total 16 [2018-09-10 10:24:45,942 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:24:45,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:24:45,943 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:24:45,943 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:24:45,944 INFO L87 Difference]: Start difference. First operand 26326 states and 32334 transitions. Second operand 7 states. [2018-09-10 10:24:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:50,391 INFO L93 Difference]: Finished difference Result 80612 states and 106146 transitions. [2018-09-10 10:24:50,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:24:50,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 339 [2018-09-10 10:24:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:50,637 INFO L225 Difference]: With dead ends: 80612 [2018-09-10 10:24:50,637 INFO L226 Difference]: Without dead ends: 54330 [2018-09-10 10:24:50,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1364 GetRequests, 1348 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:24:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54330 states. [2018-09-10 10:24:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54330 to 52546. [2018-09-10 10:24:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52546 states. [2018-09-10 10:24:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52546 states to 52546 states and 63586 transitions. [2018-09-10 10:24:51,815 INFO L78 Accepts]: Start accepts. Automaton has 52546 states and 63586 transitions. Word has length 339 [2018-09-10 10:24:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:51,815 INFO L480 AbstractCegarLoop]: Abstraction has 52546 states and 63586 transitions. [2018-09-10 10:24:51,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:24:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 52546 states and 63586 transitions. [2018-09-10 10:24:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-09-10 10:24:51,890 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:51,890 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:51,890 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:24:51,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1770463775, now seen corresponding path program 1 times [2018-09-10 10:24:51,892 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:51,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:51,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:51,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:51,893 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 201 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:24:52,451 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:52,451 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:52,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:52,728 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:53,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-10 10:24:53,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 162 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:24:53,548 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:53,549 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:24:53,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:53,563 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:54,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 90 proven. 11 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-10 10:24:55,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:55,311 WARN L175 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-09-10 10:24:55,911 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-09-10 10:24:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 160 proven. 47 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:24:56,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:24:56,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 10, 11] total 34 [2018-09-10 10:24:56,846 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:24:56,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-10 10:24:56,847 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-10 10:24:56,848 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-09-10 10:24:56,848 INFO L87 Difference]: Start difference. First operand 52546 states and 63586 transitions. Second operand 12 states. [2018-09-10 10:25:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:25:03,789 INFO L93 Difference]: Finished difference Result 139904 states and 178948 transitions. [2018-09-10 10:25:03,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-10 10:25:03,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 361 [2018-09-10 10:25:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:25:04,214 INFO L225 Difference]: With dead ends: 139904 [2018-09-10 10:25:04,214 INFO L226 Difference]: Without dead ends: 103769 [2018-09-10 10:25:04,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1473 GetRequests, 1428 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=302, Invalid=1768, Unknown=0, NotChecked=0, Total=2070 [2018-09-10 10:25:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103769 states. [2018-09-10 10:25:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103769 to 100668. [2018-09-10 10:25:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100668 states. [2018-09-10 10:25:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100668 states to 100668 states and 121032 transitions. [2018-09-10 10:25:06,745 INFO L78 Accepts]: Start accepts. Automaton has 100668 states and 121032 transitions. Word has length 361 [2018-09-10 10:25:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:25:06,746 INFO L480 AbstractCegarLoop]: Abstraction has 100668 states and 121032 transitions. [2018-09-10 10:25:06,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-10 10:25:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 100668 states and 121032 transitions. [2018-09-10 10:25:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-09-10 10:25:06,820 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:25:06,820 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:25:06,821 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:25:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash -178594023, now seen corresponding path program 1 times [2018-09-10 10:25:06,821 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:25:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:06,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:06,822 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:25:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:07,451 WARN L175 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 10:25:07,748 WARN L175 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 10:25:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 179 proven. 30 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-09-10 10:25:07,841 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:25:07,841 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:25:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:07,849 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:25:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:08,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:25:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-09-10 10:25:08,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:25:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 154 proven. 75 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-10 10:25:08,748 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:25:08,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 6] total 15 [2018-09-10 10:25:08,748 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:25:08,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:25:08,749 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:25:08,749 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:25:08,749 INFO L87 Difference]: Start difference. First operand 100668 states and 121032 transitions. Second operand 6 states. [2018-09-10 10:25:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:25:11,921 INFO L93 Difference]: Finished difference Result 173708 states and 209016 transitions. [2018-09-10 10:25:11,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 10:25:11,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 368 [2018-09-10 10:25:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:25:12,322 INFO L225 Difference]: With dead ends: 173708 [2018-09-10 10:25:12,323 INFO L226 Difference]: Without dead ends: 103587 [2018-09-10 10:25:12,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 728 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-09-10 10:25:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103587 states. [2018-09-10 10:25:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103587 to 102658. [2018-09-10 10:25:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102658 states. [2018-09-10 10:25:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102658 states to 102658 states and 122712 transitions. [2018-09-10 10:25:15,381 INFO L78 Accepts]: Start accepts. Automaton has 102658 states and 122712 transitions. Word has length 368 [2018-09-10 10:25:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:25:15,382 INFO L480 AbstractCegarLoop]: Abstraction has 102658 states and 122712 transitions. [2018-09-10 10:25:15,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:25:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 102658 states and 122712 transitions. [2018-09-10 10:25:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-09-10 10:25:15,497 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:25:15,497 INFO L376 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:25:15,497 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:25:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash -434612873, now seen corresponding path program 1 times [2018-09-10 10:25:15,498 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:25:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:15,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:15,499 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:25:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 188 proven. 103 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:25:15,955 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:25:15,955 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 10:25:15,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:15,962 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:25:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:16,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:25:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-09-10 10:25:16,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:25:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 202 proven. 30 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-09-10 10:25:16,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:25:16,649 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 10:25:16,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:16,666 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:25:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:17,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:25:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-09-10 10:25:17,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:25:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 202 proven. 30 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-09-10 10:25:17,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:25:17,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 15 [2018-09-10 10:25:17,605 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:25:17,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:25:17,606 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:25:17,606 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:25:17,607 INFO L87 Difference]: Start difference. First operand 102658 states and 122712 transitions. Second operand 13 states. [2018-09-10 10:25:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:25:29,241 INFO L93 Difference]: Finished difference Result 232292 states and 311564 transitions. [2018-09-10 10:25:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-10 10:25:29,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 389 [2018-09-10 10:25:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:25:29,837 INFO L225 Difference]: With dead ends: 232292 [2018-09-10 10:25:29,837 INFO L226 Difference]: Without dead ends: 159091 [2018-09-10 10:25:29,976 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1615 GetRequests, 1573 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=383, Invalid=1177, Unknown=0, NotChecked=0, Total=1560 [2018-09-10 10:25:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159091 states. [2018-09-10 10:25:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159091 to 153416. [2018-09-10 10:25:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153416 states. [2018-09-10 10:25:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153416 states to 153416 states and 205435 transitions. [2018-09-10 10:25:34,690 INFO L78 Accepts]: Start accepts. Automaton has 153416 states and 205435 transitions. Word has length 389 [2018-09-10 10:25:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:25:34,691 INFO L480 AbstractCegarLoop]: Abstraction has 153416 states and 205435 transitions. [2018-09-10 10:25:34,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:25:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 153416 states and 205435 transitions. [2018-09-10 10:25:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-09-10 10:25:34,880 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:25:34,881 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:25:34,881 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:25:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash 105120892, now seen corresponding path program 1 times [2018-09-10 10:25:34,881 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:25:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:34,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:34,882 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:25:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:25:35,563 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:25:35,563 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 10:25:35,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:35,570 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:25:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:35,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:25:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:25:35,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:25:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:25:37,156 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:25:37,156 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 10:25:37,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:37,177 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:25:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:37,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:25:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 185 proven. 88 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:25:38,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:25:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:25:38,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:25:38,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 7, 5] total 10 [2018-09-10 10:25:38,241 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:25:38,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:25:38,242 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:25:38,242 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:25:38,242 INFO L87 Difference]: Start difference. First operand 153416 states and 205435 transitions. Second operand 7 states. [2018-09-10 10:25:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:25:56,565 INFO L93 Difference]: Finished difference Result 550556 states and 810855 transitions. [2018-09-10 10:25:56,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:25:56,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 390 [2018-09-10 10:25:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:25:58,747 INFO L225 Difference]: With dead ends: 550556 [2018-09-10 10:25:58,747 INFO L226 Difference]: Without dead ends: 397880 [2018-09-10 10:25:59,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1568 GetRequests, 1558 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:25:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397880 states. [2018-09-10 10:26:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397880 to 381267. [2018-09-10 10:26:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381267 states. [2018-09-10 10:26:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381267 states to 381267 states and 517371 transitions. [2018-09-10 10:26:12,827 INFO L78 Accepts]: Start accepts. Automaton has 381267 states and 517371 transitions. Word has length 390 [2018-09-10 10:26:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:26:12,827 INFO L480 AbstractCegarLoop]: Abstraction has 381267 states and 517371 transitions. [2018-09-10 10:26:12,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:26:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 381267 states and 517371 transitions. [2018-09-10 10:26:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-09-10 10:26:13,353 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:26:13,354 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:26:13,354 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:26:13,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1923384722, now seen corresponding path program 1 times [2018-09-10 10:26:13,354 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:26:13,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:26:13,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:26:13,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:26:13,355 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:26:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:26:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:26:14,051 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:26:14,052 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 10:26:14,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:26:14,060 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:26:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:26:14,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:26:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-10 10:26:14,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:26:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 195 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:26:16,268 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:26:16,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 10:26:16,269 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:26:16,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:26:16,269 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:26:16,270 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:26:16,270 INFO L87 Difference]: Start difference. First operand 381267 states and 517371 transitions. Second operand 5 states. [2018-09-10 10:26:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:26:48,952 INFO L93 Difference]: Finished difference Result 1061266 states and 1518823 transitions. [2018-09-10 10:26:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:26:48,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 403 [2018-09-10 10:26:48,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:26:53,842 INFO L225 Difference]: With dead ends: 1061266 [2018-09-10 10:26:53,842 INFO L226 Difference]: Without dead ends: 750465 [2018-09-10 10:26:54,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:26:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750465 states. [2018-09-10 10:27:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750465 to 726708. [2018-09-10 10:27:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726708 states. Received shutdown request... [2018-09-10 10:27:21,104 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-10 10:27:21,110 WARN L206 ceAbstractionStarter]: Timeout [2018-09-10 10:27:21,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:27:21 BoogieIcfgContainer [2018-09-10 10:27:21,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:27:21,112 INFO L168 Benchmark]: Toolchain (without parser) took 213862.56 ms. Allocated memory was 1.5 GB in the beginning and 5.7 GB in the end (delta: 4.2 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Peak memory consumption was 5.3 GB. Max. memory is 7.1 GB. [2018-09-10 10:27:21,113 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:27:21,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1250.94 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:27:21,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 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 10:27:21,115 INFO L168 Benchmark]: Boogie Preprocessor took 359.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -946.5 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:27:21,116 INFO L168 Benchmark]: RCFGBuilder took 5055.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 293.1 MB). Peak memory consumption was 293.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:27:21,116 INFO L168 Benchmark]: TraceAbstraction took 207043.52 ms. Allocated memory was 2.3 GB in the beginning and 5.7 GB in the end (delta: 3.4 GB). Free memory was 2.0 GB in the beginning and 1.2 GB in the end (delta: 724.0 MB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. [2018-09-10 10:27:21,121 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1250.94 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 143.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 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 359.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -946.5 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5055.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 293.1 MB). Peak memory consumption was 293.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 207043.52 ms. Allocated memory was 2.3 GB in the beginning and 5.7 GB in the end (delta: 3.4 GB). Free memory was 2.0 GB in the beginning and 1.2 GB in the end (delta: 724.0 MB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1614]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1614). Cancelled while ReachableStatesComputation was computing reachable states (712004 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 206.9s OverallTime, 17 OverallIterations, 5 TraceHistogramMax, 121.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4946 SDtfs, 25083 SDslu, 5346 SDs, 0 SdLazy, 26177 SolverSat, 6566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11902 GetRequests, 11656 SyntacticMatches, 23 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381267occurred in iteration=16, 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: 53.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 31937 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 6.8s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 10959 NumberOfCodeBlocks, 10959 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 16744 ConstructedInterpolants, 0 QuantifiedInterpolants, 13851410 SizeOfPredicates, 54 NumberOfNonLiveVariables, 21969 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 51 InterpolantComputations, 13 PerfectInterpolantSequences, 8669/9382 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label11_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-27-21-142.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label11_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-27-21-142.csv Completed graceful shutdown