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_label58_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:31:45,811 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:31:45,813 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:31:45,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:31:45,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:31:45,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:31:45,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:31:45,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:31:45,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:31:45,831 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:31:45,832 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:31:45,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:31:45,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:31:45,834 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:31:45,835 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:31:45,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:31:45,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:31:45,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:31:45,841 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:31:45,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:31:45,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:31:45,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:31:45,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:31:45,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:31:45,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:31:45,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:31:45,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:31:45,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:31:45,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:31:45,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:31:45,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:31:45,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:31:45,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:31:45,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:31:45,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:31:45,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:31:45,857 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:31:45,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:31:45,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:31:45,887 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:31:45,887 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:31:45,887 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:31:45,887 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:31:45,887 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:31:45,888 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:31:45,888 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:31:45,888 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:31:45,888 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:31:45,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:31:45,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:31:45,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:31:45,890 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:31:45,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:31:45,890 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:31:45,891 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:31:45,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:31:45,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:31:45,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:31:45,892 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:31:45,892 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:31:45,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:31:45,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:31:45,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:31:45,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:31:45,893 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:31:45,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:31:45,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:31:45,893 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:31:45,893 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:31:45,894 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:31:45,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:31:45,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:31:45,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:31:45,976 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:31:45,976 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:31:45,977 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label58_true-unreach-call.c [2018-09-10 10:31:46,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e69bb299/686e37f102b24674916cde844603f36b/FLAG0d55bc681 [2018-09-10 10:31:46,691 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:31:46,692 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label58_true-unreach-call.c [2018-09-10 10:31:46,719 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e69bb299/686e37f102b24674916cde844603f36b/FLAG0d55bc681 [2018-09-10 10:31:46,738 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e69bb299/686e37f102b24674916cde844603f36b [2018-09-10 10:31:46,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:31:46,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:31:46,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:31:46,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:31:46,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:31:46,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:31:46" (1/1) ... [2018-09-10 10:31:46,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b06d656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:46, skipping insertion in model container [2018-09-10 10:31:46,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:31:46" (1/1) ... [2018-09-10 10:31:47,003 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:31:47,512 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:31:47,530 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:31:47,819 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:31:47,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47 WrapperNode [2018-09-10 10:31:47,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:31:47,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:31:47,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:31:47,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:31:47,944 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:31:47" (1/1) ... [2018-09-10 10:31:47,998 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:31:47" (1/1) ... [2018-09-10 10:31:48,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:31:48,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:31:48,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:31:48,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:31:48,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47" (1/1) ... [2018-09-10 10:31:48,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47" (1/1) ... [2018-09-10 10:31:48,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47" (1/1) ... [2018-09-10 10:31:48,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47" (1/1) ... [2018-09-10 10:31:48,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47" (1/1) ... [2018-09-10 10:31:48,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47" (1/1) ... [2018-09-10 10:31:48,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47" (1/1) ... [2018-09-10 10:31:48,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:31:48,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:31:48,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:31:48,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:31:48,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47" (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:31:48,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:31:48,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:31:48,532 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:31:48,532 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:31:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:31:48,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:31:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:31:48,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:31:53,618 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:31:53,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:31:53 BoogieIcfgContainer [2018-09-10 10:31:53,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:31:53,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:31:53,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:31:53,624 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:31:53,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:31:46" (1/3) ... [2018-09-10 10:31:53,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0d7fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:31:53, skipping insertion in model container [2018-09-10 10:31:53,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:31:47" (2/3) ... [2018-09-10 10:31:53,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0d7fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:31:53, skipping insertion in model container [2018-09-10 10:31:53,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:31:53" (3/3) ... [2018-09-10 10:31:53,629 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label58_true-unreach-call.c [2018-09-10 10:31:53,639 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:31:53,652 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:31:53,711 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:31:53,712 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:31:53,712 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:31:53,712 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:31:53,713 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:31:53,713 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:31:53,713 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:31:53,713 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:31:53,713 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:31:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-10 10:31:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-10 10:31:53,781 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:53,782 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] [2018-09-10 10:31:53,784 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:31:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash 25486780, now seen corresponding path program 1 times [2018-09-10 10:31:53,793 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:53,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:53,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:53,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:53,846 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:54,973 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:31:54,976 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:31:54,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 10:31:54,976 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:54,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:31:55,000 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:31:55,001 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:31:55,004 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-09-10 10:31:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:31:59,535 INFO L93 Difference]: Finished difference Result 1080 states and 1936 transitions. [2018-09-10 10:31:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:31:59,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-09-10 10:31:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:31:59,566 INFO L225 Difference]: With dead ends: 1080 [2018-09-10 10:31:59,566 INFO L226 Difference]: Without dead ends: 762 [2018-09-10 10:31:59,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:31:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-09-10 10:31:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 520. [2018-09-10 10:31:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-10 10:31:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 919 transitions. [2018-09-10 10:31:59,666 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 919 transitions. Word has length 167 [2018-09-10 10:31:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:31:59,667 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 919 transitions. [2018-09-10 10:31:59,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:31:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 919 transitions. [2018-09-10 10:31:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-10 10:31:59,675 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:31:59,676 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-10 10:31:59,676 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:31:59,676 INFO L82 PathProgramCache]: Analyzing trace with hash 256333056, now seen corresponding path program 1 times [2018-09-10 10:31:59,677 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:31:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:59,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:31:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:31:59,679 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:31:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:31:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:31:59,959 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:31:59,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:31:59,959 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:31:59,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:31:59,963 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:31:59,963 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:31:59,964 INFO L87 Difference]: Start difference. First operand 520 states and 919 transitions. Second operand 6 states. [2018-09-10 10:32:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:03,771 INFO L93 Difference]: Finished difference Result 1604 states and 2923 transitions. [2018-09-10 10:32:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:32:03,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2018-09-10 10:32:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:03,790 INFO L225 Difference]: With dead ends: 1604 [2018-09-10 10:32:03,791 INFO L226 Difference]: Without dead ends: 1090 [2018-09-10 10:32:03,795 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:32:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-10 10:32:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1050. [2018-09-10 10:32:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2018-09-10 10:32:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1724 transitions. [2018-09-10 10:32:03,855 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1724 transitions. Word has length 184 [2018-09-10 10:32:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:03,855 INFO L480 AbstractCegarLoop]: Abstraction has 1050 states and 1724 transitions. [2018-09-10 10:32:03,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:32:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1724 transitions. [2018-09-10 10:32:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-10 10:32:03,862 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:03,863 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:03,863 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:32:03,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1262174852, now seen corresponding path program 1 times [2018-09-10 10:32:03,863 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:03,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:03,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:03,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:03,865 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:04,409 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:04,410 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:32:04,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:04,431 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:04,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:04,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:05,746 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:05,747 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:32:05,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:05,766 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:06,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:06,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:06,712 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:32:06,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4, 4, 4] total 15 [2018-09-10 10:32:06,712 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:32:06,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-10 10:32:06,714 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-10 10:32:06,714 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:32:06,715 INFO L87 Difference]: Start difference. First operand 1050 states and 1724 transitions. Second operand 10 states. [2018-09-10 10:32:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:14,846 INFO L93 Difference]: Finished difference Result 4933 states and 8998 transitions. [2018-09-10 10:32:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-10 10:32:14,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 197 [2018-09-10 10:32:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:14,889 INFO L225 Difference]: With dead ends: 4933 [2018-09-10 10:32:14,890 INFO L226 Difference]: Without dead ends: 3889 [2018-09-10 10:32:14,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 788 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=470, Invalid=1786, Unknown=0, NotChecked=0, Total=2256 [2018-09-10 10:32:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2018-09-10 10:32:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3681. [2018-09-10 10:32:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3681 states. [2018-09-10 10:32:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 5504 transitions. [2018-09-10 10:32:15,090 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 5504 transitions. Word has length 197 [2018-09-10 10:32:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:15,091 INFO L480 AbstractCegarLoop]: Abstraction has 3681 states and 5504 transitions. [2018-09-10 10:32:15,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-10 10:32:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 5504 transitions. [2018-09-10 10:32:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-10 10:32:15,102 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:15,102 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] [2018-09-10 10:32:15,103 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:32:15,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1077960764, now seen corresponding path program 1 times [2018-09-10 10:32:15,103 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:15,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:15,105 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:15,552 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:32:15,553 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:32:15,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:32:15,553 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:32:15,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:32:15,554 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:32:15,555 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:32:15,555 INFO L87 Difference]: Start difference. First operand 3681 states and 5504 transitions. Second operand 3 states. [2018-09-10 10:32:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:17,521 INFO L93 Difference]: Finished difference Result 7362 states and 11060 transitions. [2018-09-10 10:32:17,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:32:17,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-09-10 10:32:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:17,540 INFO L225 Difference]: With dead ends: 7362 [2018-09-10 10:32:17,540 INFO L226 Difference]: Without dead ends: 3687 [2018-09-10 10:32:17,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:32:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2018-09-10 10:32:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3425. [2018-09-10 10:32:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2018-09-10 10:32:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 4764 transitions. [2018-09-10 10:32:17,644 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 4764 transitions. Word has length 213 [2018-09-10 10:32:17,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:17,645 INFO L480 AbstractCegarLoop]: Abstraction has 3425 states and 4764 transitions. [2018-09-10 10:32:17,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:32:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 4764 transitions. [2018-09-10 10:32:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-10 10:32:17,655 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:17,655 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 10:32:17,655 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:32:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash 102742418, now seen corresponding path program 1 times [2018-09-10 10:32:17,656 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:17,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:17,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:17,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:17,657 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:17,879 WARN L175 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:32:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 59 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:17,939 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:17,939 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:32:17,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:17,947 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:18,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-09-10 10:32:18,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 59 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:18,930 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:32:18,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 10:32:18,930 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:32:18,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:32:18,931 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:32:18,931 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:32:18,932 INFO L87 Difference]: Start difference. First operand 3425 states and 4764 transitions. Second operand 5 states. [2018-09-10 10:32:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:21,522 INFO L93 Difference]: Finished difference Result 10765 states and 15497 transitions. [2018-09-10 10:32:21,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:32:21,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2018-09-10 10:32:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:21,555 INFO L225 Difference]: With dead ends: 10765 [2018-09-10 10:32:21,555 INFO L226 Difference]: Without dead ends: 7346 [2018-09-10 10:32:21,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 458 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:32:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7346 states. [2018-09-10 10:32:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7346 to 7139. [2018-09-10 10:32:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7139 states. [2018-09-10 10:32:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7139 states to 7139 states and 9801 transitions. [2018-09-10 10:32:21,836 INFO L78 Accepts]: Start accepts. Automaton has 7139 states and 9801 transitions. Word has length 232 [2018-09-10 10:32:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:21,836 INFO L480 AbstractCegarLoop]: Abstraction has 7139 states and 9801 transitions. [2018-09-10 10:32:21,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:32:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 7139 states and 9801 transitions. [2018-09-10 10:32:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-10 10:32:21,858 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:21,858 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:32:21,859 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:32:21,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1444157639, now seen corresponding path program 1 times [2018-09-10 10:32:21,859 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:21,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:21,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:21,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:21,861 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:22,180 WARN L175 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 10:32:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 78 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:22,583 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:22,583 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:32:22,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:22,595 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:22,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:23,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:23,353 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:23,354 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:32:23,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:23,371 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:23,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:23,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:24,102 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:32:24,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 15 [2018-09-10 10:32:24,103 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:32:24,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:32:24,104 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:32:24,104 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:32:24,104 INFO L87 Difference]: Start difference. First operand 7139 states and 9801 transitions. Second operand 13 states. [2018-09-10 10:32:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:29,926 INFO L93 Difference]: Finished difference Result 24254 states and 38008 transitions. [2018-09-10 10:32:29,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-10 10:32:29,926 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 250 [2018-09-10 10:32:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:30,024 INFO L225 Difference]: With dead ends: 24254 [2018-09-10 10:32:30,024 INFO L226 Difference]: Without dead ends: 17121 [2018-09-10 10:32:30,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 1004 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2018-09-10 10:32:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17121 states. [2018-09-10 10:32:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17121 to 16285. [2018-09-10 10:32:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16285 states. [2018-09-10 10:32:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16285 states to 16285 states and 22494 transitions. [2018-09-10 10:32:30,601 INFO L78 Accepts]: Start accepts. Automaton has 16285 states and 22494 transitions. Word has length 250 [2018-09-10 10:32:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:30,602 INFO L480 AbstractCegarLoop]: Abstraction has 16285 states and 22494 transitions. [2018-09-10 10:32:30,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:32:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16285 states and 22494 transitions. [2018-09-10 10:32:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-10 10:32:30,647 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:30,648 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:32:30,648 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:32:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash -441003077, now seen corresponding path program 1 times [2018-09-10 10:32:30,649 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:30,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:30,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:30,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:30,651 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:31,043 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:31,043 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:32:31,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:31,051 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:31,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-09-10 10:32:31,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 107 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:31,871 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:32:31,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2018-09-10 10:32:31,871 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:32:31,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:32:31,872 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:32:31,872 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:32:31,872 INFO L87 Difference]: Start difference. First operand 16285 states and 22494 transitions. Second operand 6 states. [2018-09-10 10:32:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:34,857 INFO L93 Difference]: Finished difference Result 34859 states and 50153 transitions. [2018-09-10 10:32:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 10:32:34,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 282 [2018-09-10 10:32:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:34,959 INFO L225 Difference]: With dead ends: 34859 [2018-09-10 10:32:34,959 INFO L226 Difference]: Without dead ends: 17812 [2018-09-10 10:32:35,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 556 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:32:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17812 states. [2018-09-10 10:32:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17812 to 17330. [2018-09-10 10:32:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17330 states. [2018-09-10 10:32:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17330 states to 17330 states and 23779 transitions. [2018-09-10 10:32:35,728 INFO L78 Accepts]: Start accepts. Automaton has 17330 states and 23779 transitions. Word has length 282 [2018-09-10 10:32:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:35,729 INFO L480 AbstractCegarLoop]: Abstraction has 17330 states and 23779 transitions. [2018-09-10 10:32:35,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:32:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 17330 states and 23779 transitions. [2018-09-10 10:32:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-10 10:32:35,779 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:35,779 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:32:35,779 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:32:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1775575374, now seen corresponding path program 1 times [2018-09-10 10:32:35,780 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:35,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:35,781 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 111 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:36,452 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:36,452 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:32:36,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:36,460 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:36,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-09-10 10:32:36,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 111 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:36,943 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:32:36,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-10 10:32:36,944 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:32:36,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:32:36,945 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:32:36,945 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:32:36,945 INFO L87 Difference]: Start difference. First operand 17330 states and 23779 transitions. Second operand 5 states. [2018-09-10 10:32:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:40,110 INFO L93 Difference]: Finished difference Result 50319 states and 70348 transitions. [2018-09-10 10:32:40,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:32:40,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2018-09-10 10:32:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:40,253 INFO L225 Difference]: With dead ends: 50319 [2018-09-10 10:32:40,254 INFO L226 Difference]: Without dead ends: 32883 [2018-09-10 10:32:40,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 563 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:32:40,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32883 states. [2018-09-10 10:32:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32883 to 30114. [2018-09-10 10:32:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30114 states. [2018-09-10 10:32:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30114 states to 30114 states and 41206 transitions. [2018-09-10 10:32:41,257 INFO L78 Accepts]: Start accepts. Automaton has 30114 states and 41206 transitions. Word has length 284 [2018-09-10 10:32:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:41,258 INFO L480 AbstractCegarLoop]: Abstraction has 30114 states and 41206 transitions. [2018-09-10 10:32:41,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:32:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 30114 states and 41206 transitions. [2018-09-10 10:32:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-10 10:32:41,325 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:41,325 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:32:41,326 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:32:41,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1179429735, now seen corresponding path program 1 times [2018-09-10 10:32:41,326 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:41,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:41,327 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:41,838 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:41,838 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:32:41,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:41,851 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:42,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:42,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:43,344 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:43,344 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:32:43,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:43,362 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:43,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:44,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:44,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:32:44,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 17 [2018-09-10 10:32:44,351 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:32:44,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:32:44,353 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:32:44,353 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:32:44,353 INFO L87 Difference]: Start difference. First operand 30114 states and 41206 transitions. Second operand 9 states. [2018-09-10 10:32:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:50,780 INFO L93 Difference]: Finished difference Result 104221 states and 150170 transitions. [2018-09-10 10:32:50,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-10 10:32:50,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 303 [2018-09-10 10:32:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:51,136 INFO L225 Difference]: With dead ends: 104221 [2018-09-10 10:32:51,136 INFO L226 Difference]: Without dead ends: 73939 [2018-09-10 10:32:51,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1241 GetRequests, 1205 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-09-10 10:32:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73939 states. [2018-09-10 10:32:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73939 to 67331. [2018-09-10 10:32:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67331 states. [2018-09-10 10:32:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67331 states to 67331 states and 89673 transitions. [2018-09-10 10:32:53,469 INFO L78 Accepts]: Start accepts. Automaton has 67331 states and 89673 transitions. Word has length 303 [2018-09-10 10:32:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:32:53,470 INFO L480 AbstractCegarLoop]: Abstraction has 67331 states and 89673 transitions. [2018-09-10 10:32:53,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:32:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 67331 states and 89673 transitions. [2018-09-10 10:32:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-09-10 10:32:53,540 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:32:53,540 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:32:53,541 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:32:53,541 INFO L82 PathProgramCache]: Analyzing trace with hash -499293258, now seen corresponding path program 1 times [2018-09-10 10:32:53,541 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:32:53,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:53,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:53,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:32:53,542 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:32:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:54,177 WARN L175 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:32:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:32:54,328 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:32:54,328 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:32:54,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:32:54,346 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:32:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:32:54,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:32:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-09-10 10:32:54,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:32:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 146 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:32:54,966 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:32:54,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-09-10 10:32:54,966 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:32:54,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:32:54,967 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:32:54,967 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:32:54,968 INFO L87 Difference]: Start difference. First operand 67331 states and 89673 transitions. Second operand 5 states. [2018-09-10 10:32:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:32:59,319 INFO L93 Difference]: Finished difference Result 191783 states and 268659 transitions. [2018-09-10 10:32:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:32:59,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 321 [2018-09-10 10:32:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:32:59,930 INFO L225 Difference]: With dead ends: 191783 [2018-09-10 10:32:59,930 INFO L226 Difference]: Without dead ends: 124332 [2018-09-10 10:33:00,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:33:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124332 states. [2018-09-10 10:33:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124332 to 119316. [2018-09-10 10:33:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119316 states. [2018-09-10 10:33:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119316 states to 119316 states and 155486 transitions. [2018-09-10 10:33:04,029 INFO L78 Accepts]: Start accepts. Automaton has 119316 states and 155486 transitions. Word has length 321 [2018-09-10 10:33:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:33:04,030 INFO L480 AbstractCegarLoop]: Abstraction has 119316 states and 155486 transitions. [2018-09-10 10:33:04,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:33:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 119316 states and 155486 transitions. [2018-09-10 10:33:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-10 10:33:04,146 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:33:04,147 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:33:04,147 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:33:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash -529443391, now seen corresponding path program 1 times [2018-09-10 10:33:04,147 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:33:04,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:33:04,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:33:04,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:33:04,149 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:33:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:33:04,896 WARN L175 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:33:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 175 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:33:05,179 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:33:05,179 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:33:05,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:33:05,191 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:33:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:33:05,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:33:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-10 10:33:05,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:33:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-10 10:33:05,859 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:33:05,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2018-09-10 10:33:05,859 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:33:05,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:33:05,860 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:33:05,860 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:33:05,860 INFO L87 Difference]: Start difference. First operand 119316 states and 155486 transitions. Second operand 5 states. [2018-09-10 10:33:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:33:10,633 INFO L93 Difference]: Finished difference Result 326809 states and 447328 transitions. [2018-09-10 10:33:10,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:33:10,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 330 [2018-09-10 10:33:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:33:11,447 INFO L225 Difference]: With dead ends: 326809 [2018-09-10 10:33:11,447 INFO L226 Difference]: Without dead ends: 208115 [2018-09-10 10:33:11,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-10 10:33:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208115 states. [2018-09-10 10:33:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208115 to 203903. [2018-09-10 10:33:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203903 states. [2018-09-10 10:33:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203903 states to 203903 states and 267000 transitions. [2018-09-10 10:33:18,774 INFO L78 Accepts]: Start accepts. Automaton has 203903 states and 267000 transitions. Word has length 330 [2018-09-10 10:33:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:33:18,774 INFO L480 AbstractCegarLoop]: Abstraction has 203903 states and 267000 transitions. [2018-09-10 10:33:18,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:33:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 203903 states and 267000 transitions. [2018-09-10 10:33:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-09-10 10:33:18,924 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:33:18,925 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 10:33:18,925 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:33:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1494532938, now seen corresponding path program 1 times [2018-09-10 10:33:18,925 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:33:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:33:18,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:33:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:33:18,926 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:33:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:33:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 243 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:33:19,575 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:33:19,575 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:33:19,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:33:19,586 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:33:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:33:19,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:33:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-10 10:33:20,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:33:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-10 10:33:20,336 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:33:20,336 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 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:33:20,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:33:20,351 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:33:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:33:21,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:33:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-10 10:33:21,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:33:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-10 10:33:21,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:33:21,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 13 [2018-09-10 10:33:21,487 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:33:21,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:33:21,488 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:33:21,488 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:33:21,489 INFO L87 Difference]: Start difference. First operand 203903 states and 267000 transitions. Second operand 9 states. [2018-09-10 10:33:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:33:37,543 INFO L93 Difference]: Finished difference Result 710838 states and 1019438 transitions. [2018-09-10 10:33:37,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:33:37,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 359 [2018-09-10 10:33:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:33:39,939 INFO L225 Difference]: With dead ends: 710838 [2018-09-10 10:33:39,940 INFO L226 Difference]: Without dead ends: 507526 [2018-09-10 10:33:40,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1448 GetRequests, 1428 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:33:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507526 states. [2018-09-10 10:33:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507526 to 506624. [2018-09-10 10:33:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506624 states. [2018-09-10 10:33:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506624 states to 506624 states and 737839 transitions. [2018-09-10 10:33:59,342 INFO L78 Accepts]: Start accepts. Automaton has 506624 states and 737839 transitions. Word has length 359 [2018-09-10 10:33:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:33:59,342 INFO L480 AbstractCegarLoop]: Abstraction has 506624 states and 737839 transitions. [2018-09-10 10:33:59,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:33:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 506624 states and 737839 transitions. [2018-09-10 10:33:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-09-10 10:33:59,952 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:33:59,953 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-09-10 10:33:59,953 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:33:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1495829755, now seen corresponding path program 1 times [2018-09-10 10:33:59,953 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:33:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:33:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:33:59,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:33:59,955 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:34:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:34:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-09-10 10:34:00,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:34:00,335 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:34:00,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:34:00,344 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:34:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:34:00,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:34:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-09-10 10:34:00,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:34:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-09-10 10:34:00,893 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:34:00,894 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:34:00,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:34:00,909 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:34:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:34:01,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:34:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 232 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-10 10:34:09,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:34:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-09-10 10:34:09,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:34:09,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 6, 5] total 8 [2018-09-10 10:34:09,384 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:34:09,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:34:09,385 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:34:09,385 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-10 10:34:09,386 INFO L87 Difference]: Start difference. First operand 506624 states and 737839 transitions. Second operand 6 states. [2018-09-10 10:34:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:34:23,632 INFO L93 Difference]: Finished difference Result 923127 states and 1318058 transitions. [2018-09-10 10:34:23,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:34:23,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 392 [2018-09-10 10:34:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:34:25,368 INFO L225 Difference]: With dead ends: 923127 [2018-09-10 10:34:25,369 INFO L226 Difference]: Without dead ends: 419098 [2018-09-10 10:34:27,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1574 GetRequests, 1560 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:34:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419098 states. [2018-09-10 10:34:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419098 to 418778. [2018-09-10 10:34:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418778 states. [2018-09-10 10:34:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418778 states to 418778 states and 570905 transitions. [2018-09-10 10:34:39,942 INFO L78 Accepts]: Start accepts. Automaton has 418778 states and 570905 transitions. Word has length 392 [2018-09-10 10:34:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:34:39,943 INFO L480 AbstractCegarLoop]: Abstraction has 418778 states and 570905 transitions. [2018-09-10 10:34:39,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:34:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 418778 states and 570905 transitions. [2018-09-10 10:34:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-09-10 10:34:40,600 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:34:40,601 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:40,601 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:34:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1966353248, now seen corresponding path program 1 times [2018-09-10 10:34:40,601 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:34:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:34:40,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:34:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:34:40,602 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:34:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:34:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 289 proven. 6 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-09-10 10:34:40,942 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:34:40,942 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:34:40,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:34:40,950 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:34:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:34:42,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:34:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-09-10 10:34:42,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:34:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 289 proven. 6 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-09-10 10:34:42,869 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 10:34:42,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-09-10 10:34:42,870 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:34:42,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:34:42,870 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:34:42,870 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:34:42,871 INFO L87 Difference]: Start difference. First operand 418778 states and 570905 transitions. Second operand 3 states. [2018-09-10 10:35:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:35:05,588 INFO L93 Difference]: Finished difference Result 836192 states and 1140201 transitions. [2018-09-10 10:35:05,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:35:05,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 457 [2018-09-10 10:35:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:35:07,159 INFO L225 Difference]: With dead ends: 836192 [2018-09-10 10:35:07,159 INFO L226 Difference]: Without dead ends: 418748 [2018-09-10 10:35:07,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 911 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:35:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418748 states. Received shutdown request... [2018-09-10 10:35:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418748 to 418748. [2018-09-10 10:35:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418748 states. [2018-09-10 10:35:17,643 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-10 10:35:17,648 WARN L206 ceAbstractionStarter]: Timeout [2018-09-10 10:35:17,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:35:17 BoogieIcfgContainer [2018-09-10 10:35:17,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:35:17,649 INFO L168 Benchmark]: Toolchain (without parser) took 210897.55 ms. Allocated memory was 1.5 GB in the beginning and 6.6 GB in the end (delta: 5.0 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 6.0 GB. Max. memory is 7.1 GB. [2018-09-10 10:35:17,650 INFO L168 Benchmark]: CDTParser took 0.16 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:35:17,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1176.52 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:35:17,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.52 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:35:17,652 INFO L168 Benchmark]: Boogie Preprocessor took 376.78 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 827.3 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -961.1 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:35:17,652 INFO L168 Benchmark]: RCFGBuilder took 5158.66 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 293.4 MB). Peak memory consumption was 293.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:35:17,653 INFO L168 Benchmark]: TraceAbstraction took 204027.99 ms. Allocated memory was 2.4 GB in the beginning and 6.6 GB in the end (delta: 4.2 GB). Free memory was 2.0 GB in the beginning and 3.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 5.7 GB. Max. memory is 7.1 GB. [2018-09-10 10:35:17,662 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.16 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 1176.52 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 150.52 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 376.78 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 827.3 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -961.1 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5158.66 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 293.4 MB). Peak memory consumption was 293.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 204027.99 ms. Allocated memory was 2.4 GB in the beginning and 6.6 GB in the end (delta: 4.2 GB). Free memory was 2.0 GB in the beginning and 3.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 5.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1515]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1515). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 203.9s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 113.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3790 SDtfs, 22654 SDslu, 5676 SDs, 0 SdLazy, 20307 SolverSat, 5847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10013 GetRequests, 9776 SyntacticMatches, 36 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506624occurred in iteration=12, 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: 57.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 22104 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 8879 NumberOfCodeBlocks, 8879 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 13741 ConstructedInterpolants, 0 QuantifiedInterpolants, 8919240 SizeOfPredicates, 28 NumberOfNonLiveVariables, 19433 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 46 InterpolantComputations, 10 PerfectInterpolantSequences, 8093/8497 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_label58_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-35-17-676.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label58_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-35-17-676.csv Completed graceful shutdown