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_label00_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:23:27,228 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:23:27,230 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:23:27,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:23:27,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:23:27,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:23:27,247 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:23:27,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:23:27,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:23:27,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:23:27,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:23:27,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:23:27,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:23:27,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:23:27,259 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:23:27,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:23:27,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:23:27,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:23:27,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:23:27,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:23:27,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:23:27,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:23:27,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:23:27,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:23:27,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:23:27,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:23:27,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:23:27,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:23:27,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:23:27,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:23:27,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:23:27,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:23:27,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:23:27,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:23:27,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:23:27,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:23:27,281 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:23:27,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:23:27,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:23:27,304 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:23:27,304 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:23:27,304 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:23:27,304 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:23:27,305 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:23:27,305 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:23:27,305 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:23:27,305 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:23:27,305 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:23:27,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:23:27,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:23:27,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:23:27,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:23:27,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:23:27,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:23:27,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:23:27,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:23:27,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:23:27,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:23:27,310 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:23:27,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:23:27,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:23:27,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:23:27,311 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:23:27,312 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:23:27,312 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:23:27,312 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:23:27,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:23:27,313 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:23:27,313 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:23:27,313 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:23:27,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:23:27,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:23:27,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:23:27,405 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:23:27,406 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:23:27,407 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label00_true-unreach-call.c [2018-09-10 10:23:27,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8fea6bc/1033f6918c0d446cbbe8a92e498094da/FLAGe7c1dcd92 [2018-09-10 10:23:28,143 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:23:28,144 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label00_true-unreach-call.c [2018-09-10 10:23:28,175 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8fea6bc/1033f6918c0d446cbbe8a92e498094da/FLAGe7c1dcd92 [2018-09-10 10:23:28,198 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8fea6bc/1033f6918c0d446cbbe8a92e498094da [2018-09-10 10:23:28,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:23:28,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:23:28,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:23:28,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:23:28,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:23:28,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:23:28" (1/1) ... [2018-09-10 10:23:28,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d21a697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:28, skipping insertion in model container [2018-09-10 10:23:28,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:23:28" (1/1) ... [2018-09-10 10:23:28,512 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:23:29,007 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:23:29,026 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:23:29,280 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:23:29,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:29 WrapperNode [2018-09-10 10:23:29,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:23:29,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:23:29,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:23:29,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:23:29,356 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:29" (1/1) ... [2018-09-10 10:23:29,389 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:29" (1/1) ... [2018-09-10 10:23:29,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:23:29,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:23:29,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:23:29,490 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:23:29,764 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:29" (1/1) ... [2018-09-10 10:23:29,764 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:29" (1/1) ... [2018-09-10 10:23:29,773 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:29" (1/1) ... [2018-09-10 10:23:29,774 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:29" (1/1) ... [2018-09-10 10:23:29,820 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:29" (1/1) ... [2018-09-10 10:23:29,835 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:29" (1/1) ... [2018-09-10 10:23:29,852 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:29" (1/1) ... [2018-09-10 10:23:29,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:23:29,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:23:29,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:23:29,873 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:23:29,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:29" (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:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:23:29,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:23:29,951 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:29,951 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:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:23:29,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:23:29,952 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:23:29,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:23:34,663 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:23:34,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:34 BoogieIcfgContainer [2018-09-10 10:23:34,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:23:34,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:23:34,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:23:34,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:23:34,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:23:28" (1/3) ... [2018-09-10 10:23:34,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f0ec09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:34, skipping insertion in model container [2018-09-10 10:23:34,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:23:29" (2/3) ... [2018-09-10 10:23:34,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f0ec09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:23:34, skipping insertion in model container [2018-09-10 10:23:34,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:23:34" (3/3) ... [2018-09-10 10:23:34,675 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label00_true-unreach-call.c [2018-09-10 10:23:34,686 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:23:34,696 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:23:34,766 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:23:34,767 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:23:34,767 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:23:34,767 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:23:34,767 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:23:34,767 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:23:34,768 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:23:34,768 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:23:34,768 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:23:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-10 10:23:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-10 10:23:34,839 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:34,841 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] [2018-09-10 10:23:34,842 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:34,848 INFO L82 PathProgramCache]: Analyzing trace with hash 612696124, now seen corresponding path program 1 times [2018-09-10 10:23:34,851 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:34,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:34,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:34,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:34,912 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:35,996 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:35,998 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:35,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:35,999 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:36,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:36,024 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:36,025 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:36,028 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2018-09-10 10:23:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:38,184 INFO L93 Difference]: Finished difference Result 845 states and 1487 transitions. [2018-09-10 10:23:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:38,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-09-10 10:23:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:38,208 INFO L225 Difference]: With dead ends: 845 [2018-09-10 10:23:38,208 INFO L226 Difference]: Without dead ends: 531 [2018-09-10 10:23:38,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-09-10 10:23:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 530. [2018-09-10 10:23:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-10 10:23:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 869 transitions. [2018-09-10 10:23:38,309 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 869 transitions. Word has length 199 [2018-09-10 10:23:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:38,311 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 869 transitions. [2018-09-10 10:23:38,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 869 transitions. [2018-09-10 10:23:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-10 10:23:38,319 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:38,320 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] [2018-09-10 10:23:38,320 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:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1798317323, now seen corresponding path program 1 times [2018-09-10 10:23:38,321 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:38,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:38,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:38,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:38,323 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:38,666 WARN L175 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:23:39,002 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:39,002 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:39,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:23:39,003 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:39,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:23:39,005 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:23:39,005 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:23:39,006 INFO L87 Difference]: Start difference. First operand 530 states and 869 transitions. Second operand 6 states. [2018-09-10 10:23:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:42,945 INFO L93 Difference]: Finished difference Result 1501 states and 2543 transitions. [2018-09-10 10:23:42,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:23:42,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2018-09-10 10:23:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:42,956 INFO L225 Difference]: With dead ends: 1501 [2018-09-10 10:23:42,957 INFO L226 Difference]: Without dead ends: 977 [2018-09-10 10:23:42,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:23:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-09-10 10:23:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 957. [2018-09-10 10:23:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2018-09-10 10:23:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1498 transitions. [2018-09-10 10:23:43,025 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1498 transitions. Word has length 209 [2018-09-10 10:23:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:43,025 INFO L480 AbstractCegarLoop]: Abstraction has 957 states and 1498 transitions. [2018-09-10 10:23:43,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:23:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1498 transitions. [2018-09-10 10:23:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-10 10:23:43,030 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:43,031 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] [2018-09-10 10:23:43,031 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:23:43,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2110773816, now seen corresponding path program 1 times [2018-09-10 10:23:43,032 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:43,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:43,033 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:43,367 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:23:43,367 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:43,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:23:43,368 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:43,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:43,369 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:43,369 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:23:43,369 INFO L87 Difference]: Start difference. First operand 957 states and 1498 transitions. Second operand 3 states. [2018-09-10 10:23:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:45,742 INFO L93 Difference]: Finished difference Result 2770 states and 4468 transitions. [2018-09-10 10:23:45,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:45,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-09-10 10:23:45,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:45,764 INFO L225 Difference]: With dead ends: 2770 [2018-09-10 10:23:45,764 INFO L226 Difference]: Without dead ends: 1819 [2018-09-10 10:23:45,769 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:23:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2018-09-10 10:23:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1803. [2018-09-10 10:23:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2018-09-10 10:23:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2764 transitions. [2018-09-10 10:23:45,843 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2764 transitions. Word has length 212 [2018-09-10 10:23:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:45,844 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2764 transitions. [2018-09-10 10:23:45,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2764 transitions. [2018-09-10 10:23:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-10 10:23:45,856 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:45,857 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 10:23:45,857 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:23:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash 379225473, now seen corresponding path program 1 times [2018-09-10 10:23:45,857 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:45,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:45,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:45,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:45,859 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:46,348 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:46,348 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:46,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:46,366 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:46,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:23:46,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:23:47,447 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:23:47,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:23:47,447 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:47,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:47,448 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:47,449 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:47,450 INFO L87 Difference]: Start difference. First operand 1803 states and 2764 transitions. Second operand 3 states. [2018-09-10 10:23:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:49,742 INFO L93 Difference]: Finished difference Result 5324 states and 8388 transitions. [2018-09-10 10:23:49,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:49,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-09-10 10:23:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:49,766 INFO L225 Difference]: With dead ends: 5324 [2018-09-10 10:23:49,766 INFO L226 Difference]: Without dead ends: 3527 [2018-09-10 10:23:49,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 458 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2018-09-10 10:23:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3524. [2018-09-10 10:23:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2018-09-10 10:23:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 5209 transitions. [2018-09-10 10:23:49,877 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 5209 transitions. Word has length 230 [2018-09-10 10:23:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:49,877 INFO L480 AbstractCegarLoop]: Abstraction has 3524 states and 5209 transitions. [2018-09-10 10:23:49,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 5209 transitions. [2018-09-10 10:23:49,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-10 10:23:49,892 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:49,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,892 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:23:49,893 INFO L82 PathProgramCache]: Analyzing trace with hash -755285806, now seen corresponding path program 1 times [2018-09-10 10:23:49,893 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:49,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:49,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:49,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:49,894 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:50,418 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:50,418 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:50,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:50,430 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:50,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:23:50,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-10 10:23:51,136 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:23:51,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-10 10:23:51,137 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:51,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:23:51,138 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:23:51,138 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:51,138 INFO L87 Difference]: Start difference. First operand 3524 states and 5209 transitions. Second operand 3 states. [2018-09-10 10:23:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:52,575 INFO L93 Difference]: Finished difference Result 10464 states and 15875 transitions. [2018-09-10 10:23:52,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:23:52,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-09-10 10:23:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:52,623 INFO L225 Difference]: With dead ends: 10464 [2018-09-10 10:23:52,623 INFO L226 Difference]: Without dead ends: 6946 [2018-09-10 10:23:52,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 472 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:23:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2018-09-10 10:23:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6937. [2018-09-10 10:23:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6937 states. [2018-09-10 10:23:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6937 states to 6937 states and 10052 transitions. [2018-09-10 10:23:52,812 INFO L78 Accepts]: Start accepts. Automaton has 6937 states and 10052 transitions. Word has length 237 [2018-09-10 10:23:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:52,813 INFO L480 AbstractCegarLoop]: Abstraction has 6937 states and 10052 transitions. [2018-09-10 10:23:52,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:23:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 6937 states and 10052 transitions. [2018-09-10 10:23:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-10 10:23:52,840 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:52,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,841 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:23:52,842 INFO L82 PathProgramCache]: Analyzing trace with hash 672504388, now seen corresponding path program 1 times [2018-09-10 10:23:52,842 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:52,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:52,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:52,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:52,843 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:53,374 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:23:53,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 10:23:53,374 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:53,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:23:53,375 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:23:53,375 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:23:53,375 INFO L87 Difference]: Start difference. First operand 6937 states and 10052 transitions. Second operand 4 states. [2018-09-10 10:23:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:23:56,215 INFO L93 Difference]: Finished difference Result 19118 states and 27950 transitions. [2018-09-10 10:23:56,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:23:56,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2018-09-10 10:23:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:23:56,288 INFO L225 Difference]: With dead ends: 19118 [2018-09-10 10:23:56,290 INFO L226 Difference]: Without dead ends: 12187 [2018-09-10 10:23:56,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:23:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12187 states. [2018-09-10 10:23:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12187 to 12169. [2018-09-10 10:23:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12169 states. [2018-09-10 10:23:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12169 states to 12169 states and 17360 transitions. [2018-09-10 10:23:56,657 INFO L78 Accepts]: Start accepts. Automaton has 12169 states and 17360 transitions. Word has length 245 [2018-09-10 10:23:56,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:23:56,658 INFO L480 AbstractCegarLoop]: Abstraction has 12169 states and 17360 transitions. [2018-09-10 10:23:56,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:23:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 12169 states and 17360 transitions. [2018-09-10 10:23:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-10 10:23:56,689 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:23:56,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,690 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:23:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash 439495155, now seen corresponding path program 1 times [2018-09-10 10:23:56,697 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:23:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:56,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:23:56,698 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:23:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:23:57,247 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:23:57,247 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:23:57,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:23:57,263 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:23:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:23:57,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:23:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-10 10:23:57,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:23:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:23:58,289 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:23:58,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-09-10 10:23:58,290 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:23:58,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:23:58,291 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:23:58,291 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:23:58,291 INFO L87 Difference]: Start difference. First operand 12169 states and 17360 transitions. Second operand 5 states. [2018-09-10 10:24:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:02,115 INFO L93 Difference]: Finished difference Result 33078 states and 49677 transitions. [2018-09-10 10:24:02,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:24:02,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 256 [2018-09-10 10:24:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:02,233 INFO L225 Difference]: With dead ends: 33078 [2018-09-10 10:24:02,234 INFO L226 Difference]: Without dead ends: 20915 [2018-09-10 10:24:02,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:24:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20915 states. [2018-09-10 10:24:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20915 to 20574. [2018-09-10 10:24:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20574 states. [2018-09-10 10:24:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20574 states to 20574 states and 28600 transitions. [2018-09-10 10:24:02,875 INFO L78 Accepts]: Start accepts. Automaton has 20574 states and 28600 transitions. Word has length 256 [2018-09-10 10:24:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:02,875 INFO L480 AbstractCegarLoop]: Abstraction has 20574 states and 28600 transitions. [2018-09-10 10:24:02,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:24:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 20574 states and 28600 transitions. [2018-09-10 10:24:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-10 10:24:02,931 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:02,931 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,932 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:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash -204377464, now seen corresponding path program 1 times [2018-09-10 10:24:02,932 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:02,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:02,933 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:03,464 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:03,464 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:03,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:03,479 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:03,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:03,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:04,474 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:04,475 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:24:04,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:04,493 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:05,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:05,472 WARN L175 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-09-10 10:24:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 59 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:05,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:05,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:24:05,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 7, 5] total 13 [2018-09-10 10:24:05,866 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:24:05,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:24:05,867 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:24:05,867 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:24:05,868 INFO L87 Difference]: Start difference. First operand 20574 states and 28600 transitions. Second operand 6 states. [2018-09-10 10:24:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:07,883 INFO L93 Difference]: Finished difference Result 39062 states and 53962 transitions. [2018-09-10 10:24:07,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:24:07,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-09-10 10:24:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:07,940 INFO L225 Difference]: With dead ends: 39062 [2018-09-10 10:24:07,940 INFO L226 Difference]: Without dead ends: 18494 [2018-09-10 10:24:07,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1051 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:24:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18494 states. [2018-09-10 10:24:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18494 to 18413. [2018-09-10 10:24:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18413 states. [2018-09-10 10:24:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18413 states to 18413 states and 24495 transitions. [2018-09-10 10:24:08,332 INFO L78 Accepts]: Start accepts. Automaton has 18413 states and 24495 transitions. Word has length 265 [2018-09-10 10:24:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:08,332 INFO L480 AbstractCegarLoop]: Abstraction has 18413 states and 24495 transitions. [2018-09-10 10:24:08,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:24:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 18413 states and 24495 transitions. [2018-09-10 10:24:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-09-10 10:24:08,368 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:08,368 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:08,369 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:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2102724034, now seen corresponding path program 1 times [2018-09-10 10:24:08,369 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:08,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:08,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:08,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:08,370 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:09,159 WARN L175 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 12 [2018-09-10 10:24:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:10,136 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:10,136 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:10,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:10,145 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:10,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:10,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:11,505 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:24:11,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [14] total 19 [2018-09-10 10:24:11,505 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:11,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:24:11,506 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:24:11,506 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-09-10 10:24:11,507 INFO L87 Difference]: Start difference. First operand 18413 states and 24495 transitions. Second operand 5 states. [2018-09-10 10:24:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:14,099 INFO L93 Difference]: Finished difference Result 47031 states and 64247 transitions. [2018-09-10 10:24:14,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:24:14,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 319 [2018-09-10 10:24:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:14,202 INFO L225 Difference]: With dead ends: 47031 [2018-09-10 10:24:14,202 INFO L226 Difference]: Without dead ends: 28624 [2018-09-10 10:24:14,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 635 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-09-10 10:24:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28624 states. [2018-09-10 10:24:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28624 to 28246. [2018-09-10 10:24:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28246 states. [2018-09-10 10:24:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28246 states to 28246 states and 37845 transitions. [2018-09-10 10:24:14,821 INFO L78 Accepts]: Start accepts. Automaton has 28246 states and 37845 transitions. Word has length 319 [2018-09-10 10:24:14,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:14,821 INFO L480 AbstractCegarLoop]: Abstraction has 28246 states and 37845 transitions. [2018-09-10 10:24:14,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:24:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 28246 states and 37845 transitions. [2018-09-10 10:24:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-09-10 10:24:14,871 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:14,872 INFO L376 BasicCegarLoop]: trace histogram [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, 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] [2018-09-10 10:24:14,872 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:14,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1750536031, now seen corresponding path program 1 times [2018-09-10 10:24:14,872 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:14,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:14,874 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:15,663 WARN L175 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 12 [2018-09-10 10:24:16,246 WARN L175 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-09-10 10:24:16,567 WARN L175 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-10 10:24:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 127 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:18,121 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:18,121 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:18,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:18,129 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:18,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:24:18,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:24:19,215 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:24:19,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [17] total 23 [2018-09-10 10:24:19,216 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:19,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:24:19,218 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:24:19,220 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-09-10 10:24:19,220 INFO L87 Difference]: Start difference. First operand 28246 states and 37845 transitions. Second operand 5 states. [2018-09-10 10:24:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:21,954 INFO L93 Difference]: Finished difference Result 73193 states and 100209 transitions. [2018-09-10 10:24:21,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:24:21,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 331 [2018-09-10 10:24:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:22,111 INFO L225 Difference]: With dead ends: 73193 [2018-09-10 10:24:22,111 INFO L226 Difference]: Without dead ends: 44953 [2018-09-10 10:24:22,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 657 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-09-10 10:24:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44953 states. [2018-09-10 10:24:23,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44953 to 44353. [2018-09-10 10:24:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44353 states. [2018-09-10 10:24:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44353 states to 44353 states and 58555 transitions. [2018-09-10 10:24:23,445 INFO L78 Accepts]: Start accepts. Automaton has 44353 states and 58555 transitions. Word has length 331 [2018-09-10 10:24:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:23,446 INFO L480 AbstractCegarLoop]: Abstraction has 44353 states and 58555 transitions. [2018-09-10 10:24:23,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:24:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 44353 states and 58555 transitions. [2018-09-10 10:24:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-09-10 10:24:23,509 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:23,509 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:24:23,510 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:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1910842938, now seen corresponding path program 1 times [2018-09-10 10:24:23,510 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:23,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:23,511 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 208 proven. 38 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-10 10:24:24,140 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:24,140 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:24,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:24,155 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:24,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 221 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:24:24,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 223 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:24:25,092 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:25,092 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:25,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:25,111 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:25,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 221 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:24:26,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 223 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-10 10:24:26,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:24:26,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-10 10:24:26,323 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:24:26,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:24:26,324 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:24:26,325 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:24:26,325 INFO L87 Difference]: Start difference. First operand 44353 states and 58555 transitions. Second operand 9 states. [2018-09-10 10:24:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:36,221 INFO L93 Difference]: Finished difference Result 115818 states and 179330 transitions. [2018-09-10 10:24:36,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-10 10:24:36,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 383 [2018-09-10 10:24:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:37,104 INFO L225 Difference]: With dead ends: 115818 [2018-09-10 10:24:37,104 INFO L226 Difference]: Without dead ends: 71471 [2018-09-10 10:24:37,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1611 GetRequests, 1555 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=520, Invalid=2342, Unknown=0, NotChecked=0, Total=2862 [2018-09-10 10:24:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71471 states. [2018-09-10 10:24:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71471 to 66396. [2018-09-10 10:24:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66396 states. [2018-09-10 10:24:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66396 states to 66396 states and 83082 transitions. [2018-09-10 10:24:38,779 INFO L78 Accepts]: Start accepts. Automaton has 66396 states and 83082 transitions. Word has length 383 [2018-09-10 10:24:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:38,780 INFO L480 AbstractCegarLoop]: Abstraction has 66396 states and 83082 transitions. [2018-09-10 10:24:38,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:24:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 66396 states and 83082 transitions. [2018-09-10 10:24:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-09-10 10:24:38,894 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:38,894 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,894 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:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash -839481589, now seen corresponding path program 1 times [2018-09-10 10:24:38,895 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:38,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:38,896 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 350 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:24:41,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:41,812 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:41,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:41,820 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:42,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-09-10 10:24:42,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 237 proven. 140 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:24:43,255 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:24:43,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [19, 6] total 25 [2018-09-10 10:24:43,255 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:24:43,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:24:43,256 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:24:43,256 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2018-09-10 10:24:43,256 INFO L87 Difference]: Start difference. First operand 66396 states and 83082 transitions. Second operand 5 states. [2018-09-10 10:24:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:24:45,913 INFO L93 Difference]: Finished difference Result 152929 states and 189796 transitions. [2018-09-10 10:24:45,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:24:45,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 437 [2018-09-10 10:24:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:24:46,162 INFO L225 Difference]: With dead ends: 152929 [2018-09-10 10:24:46,162 INFO L226 Difference]: Without dead ends: 86559 [2018-09-10 10:24:46,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 866 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-09-10 10:24:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86559 states. [2018-09-10 10:24:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86559 to 85718. [2018-09-10 10:24:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85718 states. [2018-09-10 10:24:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85718 states to 85718 states and 105442 transitions. [2018-09-10 10:24:48,121 INFO L78 Accepts]: Start accepts. Automaton has 85718 states and 105442 transitions. Word has length 437 [2018-09-10 10:24:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:24:48,121 INFO L480 AbstractCegarLoop]: Abstraction has 85718 states and 105442 transitions. [2018-09-10 10:24:48,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:24:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 85718 states and 105442 transitions. [2018-09-10 10:24:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-09-10 10:24:48,250 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:24:48,250 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,251 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:48,251 INFO L82 PathProgramCache]: Analyzing trace with hash -826590503, now seen corresponding path program 1 times [2018-09-10 10:24:48,251 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:24:48,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:48,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:24:48,252 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:24:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 268 proven. 98 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-10 10:24:48,792 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:48,792 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:24:48,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:48,801 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:49,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 360 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-10 10:24:49,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 360 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-10 10:24:49,692 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:24:49,692 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:24:49,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:24:49,707 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:24:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:24:50,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:24:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 360 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-10 10:24:50,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:24:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 360 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-10 10:24:50,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:24:50,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-10 10:24:50,930 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:24:50,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:24:50,930 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:24:50,931 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:24:50,931 INFO L87 Difference]: Start difference. First operand 85718 states and 105442 transitions. Second operand 9 states. [2018-09-10 10:25:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:25:03,040 INFO L93 Difference]: Finished difference Result 197881 states and 278309 transitions. [2018-09-10 10:25:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-10 10:25:03,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 443 [2018-09-10 10:25:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:25:03,619 INFO L225 Difference]: With dead ends: 197881 [2018-09-10 10:25:03,620 INFO L226 Difference]: Without dead ends: 113848 [2018-09-10 10:25:04,361 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1847 GetRequests, 1792 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=527, Invalid=2443, Unknown=0, NotChecked=0, Total=2970 [2018-09-10 10:25:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113848 states. [2018-09-10 10:25:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113848 to 105392. [2018-09-10 10:25:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105392 states. [2018-09-10 10:25:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105392 states to 105392 states and 125423 transitions. [2018-09-10 10:25:06,303 INFO L78 Accepts]: Start accepts. Automaton has 105392 states and 125423 transitions. Word has length 443 [2018-09-10 10:25:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:25:06,303 INFO L480 AbstractCegarLoop]: Abstraction has 105392 states and 125423 transitions. [2018-09-10 10:25:06,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:25:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 105392 states and 125423 transitions. [2018-09-10 10:25:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-09-10 10:25:06,419 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:25:06,419 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,419 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,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1559683821, now seen corresponding path program 1 times [2018-09-10 10:25:06,420 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:25:06,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:06,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:06,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:06,421 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:25:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 300 proven. 20 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-09-10 10:25:06,899 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:25:06,899 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:06,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:06,908 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:25:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:07,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:25:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 409 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-09-10 10:25:07,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:25:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 369 proven. 38 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-09-10 10:25:08,317 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:25:08,317 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:08,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:08,332 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:25:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:09,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:25:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 409 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-09-10 10:25:09,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:25:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 369 proven. 38 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-09-10 10:25:09,715 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:25:09,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 16 [2018-09-10 10:25:09,716 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:25:09,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:25:09,717 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:25:09,717 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-10 10:25:09,717 INFO L87 Difference]: Start difference. First operand 105392 states and 125423 transitions. Second operand 8 states. [2018-09-10 10:25:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:25:21,826 INFO L93 Difference]: Finished difference Result 356549 states and 432283 transitions. [2018-09-10 10:25:21,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-10 10:25:21,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 494 [2018-09-10 10:25:21,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:25:22,571 INFO L225 Difference]: With dead ends: 356549 [2018-09-10 10:25:22,571 INFO L226 Difference]: Without dead ends: 253131 [2018-09-10 10:25:22,759 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2027 GetRequests, 1988 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=285, Invalid=1275, Unknown=0, NotChecked=0, Total=1560 [2018-09-10 10:25:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253131 states. [2018-09-10 10:25:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253131 to 249838. [2018-09-10 10:25:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249838 states. [2018-09-10 10:25:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249838 states to 249838 states and 287164 transitions. [2018-09-10 10:25:26,618 INFO L78 Accepts]: Start accepts. Automaton has 249838 states and 287164 transitions. Word has length 494 [2018-09-10 10:25:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:25:26,619 INFO L480 AbstractCegarLoop]: Abstraction has 249838 states and 287164 transitions. [2018-09-10 10:25:26,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:25:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 249838 states and 287164 transitions. [2018-09-10 10:25:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-09-10 10:25:27,042 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:25:27,043 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:25:27,043 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:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1127888220, now seen corresponding path program 1 times [2018-09-10 10:25:27,044 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:25:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:27,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:27,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:25:27,046 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:25:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 376 proven. 84 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-09-10 10:25:27,685 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:25:27,685 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:27,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:27,694 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:25:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:29,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:25:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 424 proven. 6 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-09-10 10:25:29,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:25:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 403 proven. 194 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-09-10 10:25:29,820 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:25:29,820 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:29,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:25:29,838 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:25:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:25:30,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:25:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 421 proven. 2 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-09-10 10:25:31,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:25:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 398 proven. 154 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-09-10 10:25:31,382 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:25:31,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 7, 5, 5] total 24 [2018-09-10 10:25:31,383 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:25:31,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-10 10:25:31,384 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-10 10:25:31,384 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-09-10 10:25:31,384 INFO L87 Difference]: Start difference. First operand 249838 states and 287164 transitions. Second operand 15 states. [2018-09-10 10:25:45,163 WARN L175 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-09-10 10:25:47,029 WARN L175 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-09-10 10:25:49,533 WARN L175 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-09-10 10:25:52,113 WARN L175 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-10 10:26:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:26:04,038 INFO L93 Difference]: Finished difference Result 704542 states and 923506 transitions. [2018-09-10 10:26:04,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-10 10:26:04,039 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 531 [2018-09-10 10:26:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:26:06,982 INFO L225 Difference]: With dead ends: 704542 [2018-09-10 10:26:06,983 INFO L226 Difference]: Without dead ends: 456815 [2018-09-10 10:26:07,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2315 GetRequests, 2194 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5202 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2312, Invalid=12450, Unknown=0, NotChecked=0, Total=14762 [2018-09-10 10:26:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456815 states. [2018-09-10 10:26:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456815 to 415606. [2018-09-10 10:26:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415606 states. [2018-09-10 10:26:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415606 states to 415606 states and 471270 transitions. [2018-09-10 10:26:17,912 INFO L78 Accepts]: Start accepts. Automaton has 415606 states and 471270 transitions. Word has length 531 [2018-09-10 10:26:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:26:17,912 INFO L480 AbstractCegarLoop]: Abstraction has 415606 states and 471270 transitions. [2018-09-10 10:26:17,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-10 10:26:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 415606 states and 471270 transitions. [2018-09-10 10:26:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-09-10 10:26:18,354 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:26:18,354 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 10:26:18,355 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:26:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1458501389, now seen corresponding path program 1 times [2018-09-10 10:26:18,355 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:26:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:26:18,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:26:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:26:18,356 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:26:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:26:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 380 proven. 197 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-09-10 10:26:19,217 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:26:19,217 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:19,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:26:19,226 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:26:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:26:19,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:26:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 577 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-09-10 10:26:19,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:26:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 577 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-09-10 10:26:20,817 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:26:20,817 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:26:20,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:26:20,833 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:26:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:26:21,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:26:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 577 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-09-10 10:26:22,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:26:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 577 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-09-10 10:26:22,373 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:26:22,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 17 [2018-09-10 10:26:22,374 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:26:22,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:26:22,375 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:26:22,376 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:26:22,376 INFO L87 Difference]: Start difference. First operand 415606 states and 471270 transitions. Second operand 9 states. [2018-09-10 10:27:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:27:04,493 INFO L93 Difference]: Finished difference Result 1466810 states and 1762206 transitions. [2018-09-10 10:27:04,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-10 10:27:04,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 563 [2018-09-10 10:27:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-09-10 10:27:08,794 INFO L225 Difference]: With dead ends: 1466810 [2018-09-10 10:27:08,794 INFO L226 Difference]: Without dead ends: 1053241 [2018-09-10 10:27:09,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2312 GetRequests, 2267 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=378, Invalid=1692, Unknown=0, NotChecked=0, Total=2070 [2018-09-10 10:27:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053241 states. [2018-09-10 10:27:09,791 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-10 10:27:09,795 WARN L206 ceAbstractionStarter]: Timeout [2018-09-10 10:27:09,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:27:09 BoogieIcfgContainer [2018-09-10 10:27:09,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:27:09,796 INFO L168 Benchmark]: Toolchain (without parser) took 221585.84 ms. Allocated memory was 1.5 GB in the beginning and 5.9 GB in the end (delta: 4.4 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2018-09-10 10:27:09,797 INFO L168 Benchmark]: CDTParser took 0.24 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:09,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1127.83 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:09,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.49 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:09,799 INFO L168 Benchmark]: Boogie Preprocessor took 383.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -921.1 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:27:09,800 INFO L168 Benchmark]: RCFGBuilder took 4792.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 280.0 MB). Peak memory consumption was 280.0 MB. Max. memory is 7.1 GB. [2018-09-10 10:27:09,801 INFO L168 Benchmark]: TraceAbstraction took 215129.40 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 2.0 GB in the beginning and 3.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-09-10 10:27:09,805 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.24 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 1127.83 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.49 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 383.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -921.1 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4792.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 280.0 MB). Peak memory consumption was 280.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 215129.40 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 2.0 GB in the beginning and 3.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1611]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1611). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 215.0s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 150.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3313 SDtfs, 22717 SDslu, 4800 SDs, 0 SdLazy, 44057 SolverSat, 9560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14896 GetRequests, 14454 SyntacticMatches, 25 SemanticMatches, 417 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8110 ImplicationChecksByTransitivity, 20.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415606occurred in iteration=15, 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: 23.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 60341 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.4s SsaConstructionTime, 9.3s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 12522 NumberOfCodeBlocks, 12522 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 19638 ConstructedInterpolants, 0 QuantifiedInterpolants, 29550050 SizeOfPredicates, 56 NumberOfNonLiveVariables, 26344 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 52 InterpolantComputations, 14 PerfectInterpolantSequences, 15097/16242 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_label00_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-27-09-822.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label00_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-27-09-822.csv Completed graceful shutdown