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/Problem18_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 12:36:25,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 12:36:25,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 12:36:25,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 12:36:25,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 12:36:25,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 12:36:25,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 12:36:25,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 12:36:25,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 12:36:25,985 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 12:36:25,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 12:36:25,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 12:36:25,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 12:36:25,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 12:36:25,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 12:36:25,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 12:36:25,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 12:36:25,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 12:36:25,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 12:36:25,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 12:36:25,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 12:36:25,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 12:36:26,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 12:36:26,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 12:36:26,002 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 12:36:26,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 12:36:26,003 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 12:36:26,004 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 12:36:26,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 12:36:26,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 12:36:26,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 12:36:26,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 12:36:26,008 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 12:36:26,008 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 12:36:26,009 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 12:36:26,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 12:36:26,010 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 12:36:26,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 12:36:26,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 12:36:26,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 12:36:26,029 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 12:36:26,029 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 12:36:26,030 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 12:36:26,030 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 12:36:26,030 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 12:36:26,030 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 12:36:26,030 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 12:36:26,031 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 12:36:26,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 12:36:26,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 12:36:26,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 12:36:26,032 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 12:36:26,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 12:36:26,032 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 12:36:26,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 12:36:26,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 12:36:26,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 12:36:26,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 12:36:26,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 12:36:26,034 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 12:36:26,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:36:26,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 12:36:26,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 12:36:26,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 12:36:26,035 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 12:36:26,035 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 12:36:26,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 12:36:26,035 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 12:36:26,036 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 12:36:26,036 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 12:36:26,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 12:36:26,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 12:36:26,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 12:36:26,129 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 12:36:26,129 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 12:36:26,131 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label23_true-unreach-call.c [2018-09-10 12:36:26,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aac8536b/7c04d48abc39419dbfee9cc28d6ce024/FLAGade07e562 [2018-09-10 12:36:26,926 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 12:36:26,927 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label23_true-unreach-call.c [2018-09-10 12:36:26,953 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aac8536b/7c04d48abc39419dbfee9cc28d6ce024/FLAGade07e562 [2018-09-10 12:36:26,969 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aac8536b/7c04d48abc39419dbfee9cc28d6ce024 [2018-09-10 12:36:26,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 12:36:26,984 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 12:36:26,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 12:36:26,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 12:36:26,992 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 12:36:26,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:36:26" (1/1) ... [2018-09-10 12:36:26,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbc8a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:26, skipping insertion in model container [2018-09-10 12:36:26,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:36:26" (1/1) ... [2018-09-10 12:36:27,340 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 12:36:28,202 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:36:28,221 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 12:36:28,707 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:36:28,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28 WrapperNode [2018-09-10 12:36:28,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 12:36:28,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 12:36:28,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 12:36:28,875 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 12:36:28,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... [2018-09-10 12:36:28,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... [2018-09-10 12:36:29,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 12:36:29,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 12:36:29,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 12:36:29,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 12:36:29,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... [2018-09-10 12:36:29,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... [2018-09-10 12:36:29,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... [2018-09-10 12:36:29,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... [2018-09-10 12:36:29,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... [2018-09-10 12:36:29,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... [2018-09-10 12:36:29,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... [2018-09-10 12:36:29,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 12:36:29,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 12:36:29,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 12:36:29,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 12:36:29,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:36:29,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 12:36:29,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 12:36:29,772 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 12:36:29,772 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 12:36:29,772 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_output3 [2018-09-10 12:36:29,772 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_output3 [2018-09-10 12:36:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 12:36:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 12:36:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 12:36:29,773 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 12:36:29,773 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_output2 [2018-09-10 12:36:29,773 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_output2 [2018-09-10 12:36:38,053 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 12:36:38,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:36:38 BoogieIcfgContainer [2018-09-10 12:36:38,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 12:36:38,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 12:36:38,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 12:36:38,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 12:36:38,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:36:26" (1/3) ... [2018-09-10 12:36:38,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d707e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:36:38, skipping insertion in model container [2018-09-10 12:36:38,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:36:28" (2/3) ... [2018-09-10 12:36:38,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d707e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:36:38, skipping insertion in model container [2018-09-10 12:36:38,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:36:38" (3/3) ... [2018-09-10 12:36:38,062 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label23_true-unreach-call.c [2018-09-10 12:36:38,073 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 12:36:38,086 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 12:36:38,151 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 12:36:38,152 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 12:36:38,152 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 12:36:38,152 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 12:36:38,152 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 12:36:38,152 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 12:36:38,153 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 12:36:38,153 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 12:36:38,153 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 12:36:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-09-10 12:36:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-10 12:36:38,205 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:36:38,207 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] [2018-09-10 12:36:38,208 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 12:36:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash 573500740, now seen corresponding path program 1 times [2018-09-10 12:36:38,217 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:36:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:36:38,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:36:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:36:38,276 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:36:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:36:38,733 WARN L175 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:36:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:36:38,825 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:36:38,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 12:36:38,825 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:36:38,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:36:38,847 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:36:38,848 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:36:38,851 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-09-10 12:36:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:36:45,799 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-09-10 12:36:45,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:36:45,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-09-10 12:36:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:36:45,836 INFO L225 Difference]: With dead ends: 2251 [2018-09-10 12:36:45,836 INFO L226 Difference]: Without dead ends: 1474 [2018-09-10 12:36:45,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:36:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-09-10 12:36:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-09-10 12:36:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-09-10 12:36:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2801 transitions. [2018-09-10 12:36:46,020 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2801 transitions. Word has length 62 [2018-09-10 12:36:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:36:46,021 INFO L480 AbstractCegarLoop]: Abstraction has 1474 states and 2801 transitions. [2018-09-10 12:36:46,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:36:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2801 transitions. [2018-09-10 12:36:46,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-10 12:36:46,031 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:36:46,031 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:36:46,032 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 12:36:46,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1540816566, now seen corresponding path program 1 times [2018-09-10 12:36:46,032 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:36:46,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:36:46,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:36:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:36:46,034 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:36:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:36:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:36:46,316 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:36:46,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 12:36:46,317 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:36:46,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:36:46,320 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:36:46,320 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 12:36:46,321 INFO L87 Difference]: Start difference. First operand 1474 states and 2801 transitions. Second operand 5 states. [2018-09-10 12:37:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:37:00,183 INFO L93 Difference]: Finished difference Result 5816 states and 11218 transitions. [2018-09-10 12:37:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:37:00,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2018-09-10 12:37:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:37:00,228 INFO L225 Difference]: With dead ends: 5816 [2018-09-10 12:37:00,228 INFO L226 Difference]: Without dead ends: 4348 [2018-09-10 12:37:00,239 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-10 12:37:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2018-09-10 12:37:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 4314. [2018-09-10 12:37:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4314 states. [2018-09-10 12:37:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 6829 transitions. [2018-09-10 12:37:00,486 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 6829 transitions. Word has length 152 [2018-09-10 12:37:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:37:00,487 INFO L480 AbstractCegarLoop]: Abstraction has 4314 states and 6829 transitions. [2018-09-10 12:37:00,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:37:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 6829 transitions. [2018-09-10 12:37:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-10 12:37:00,501 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:37:00,501 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:37:00,504 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 12:37:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash -402239432, now seen corresponding path program 1 times [2018-09-10 12:37:00,504 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:37:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:00,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:00,506 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:37:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 110 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:37:00,781 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:37:00,781 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:37:00,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:00,792 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:37:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:00,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:37:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-10 12:37:01,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:37:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 110 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:37:01,593 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:37:01,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2018-09-10 12:37:01,593 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:37:01,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:37:01,594 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:37:01,594 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-09-10 12:37:01,595 INFO L87 Difference]: Start difference. First operand 4314 states and 6829 transitions. Second operand 5 states. [2018-09-10 12:37:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:37:09,057 INFO L93 Difference]: Finished difference Result 11690 states and 18879 transitions. [2018-09-10 12:37:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:37:09,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-09-10 12:37:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:37:09,112 INFO L225 Difference]: With dead ends: 11690 [2018-09-10 12:37:09,113 INFO L226 Difference]: Without dead ends: 7382 [2018-09-10 12:37:09,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 439 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-09-10 12:37:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-09-10 12:37:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7285. [2018-09-10 12:37:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7285 states. [2018-09-10 12:37:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7285 states to 7285 states and 9839 transitions. [2018-09-10 12:37:09,325 INFO L78 Accepts]: Start accepts. Automaton has 7285 states and 9839 transitions. Word has length 222 [2018-09-10 12:37:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:37:09,326 INFO L480 AbstractCegarLoop]: Abstraction has 7285 states and 9839 transitions. [2018-09-10 12:37:09,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:37:09,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7285 states and 9839 transitions. [2018-09-10 12:37:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-09-10 12:37:09,333 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:37:09,334 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:37:09,334 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 12:37:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1958730801, now seen corresponding path program 1 times [2018-09-10 12:37:09,335 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:37:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:09,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:09,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:09,336 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:37:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:09,722 WARN L175 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:37:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:37:10,195 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:37:10,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:37:10,196 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:37:10,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:37:10,197 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:37:10,197 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:37:10,197 INFO L87 Difference]: Start difference. First operand 7285 states and 9839 transitions. Second operand 6 states. [2018-09-10 12:37:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:37:16,891 INFO L93 Difference]: Finished difference Result 19812 states and 27180 transitions. [2018-09-10 12:37:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:37:16,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 297 [2018-09-10 12:37:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:37:16,948 INFO L225 Difference]: With dead ends: 19812 [2018-09-10 12:37:16,948 INFO L226 Difference]: Without dead ends: 12533 [2018-09-10 12:37:16,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:37:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12533 states. [2018-09-10 12:37:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12533 to 12359. [2018-09-10 12:37:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12359 states. [2018-09-10 12:37:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12359 states to 12359 states and 16294 transitions. [2018-09-10 12:37:17,259 INFO L78 Accepts]: Start accepts. Automaton has 12359 states and 16294 transitions. Word has length 297 [2018-09-10 12:37:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:37:17,260 INFO L480 AbstractCegarLoop]: Abstraction has 12359 states and 16294 transitions. [2018-09-10 12:37:17,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:37:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 12359 states and 16294 transitions. [2018-09-10 12:37:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-10 12:37:17,272 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:37:17,272 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-10 12:37:17,272 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 12:37:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1228740598, now seen corresponding path program 1 times [2018-09-10 12:37:17,273 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:37:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:17,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:17,274 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:37:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 238 proven. 69 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-09-10 12:37:17,685 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:37:17,685 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:37:17,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:17,702 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:37:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:17,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:37:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 338 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-10 12:37:18,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:37:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 238 proven. 69 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-09-10 12:37:18,500 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:37:18,500 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:37:18,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:18,518 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:37:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:18,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:37:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 338 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-10 12:37:18,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:37:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 238 proven. 69 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-09-10 12:37:19,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:37:19,528 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 11 [2018-09-10 12:37:19,529 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:37:19,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 12:37:19,530 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 12:37:19,530 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:37:19,530 INFO L87 Difference]: Start difference. First operand 12359 states and 16294 transitions. Second operand 8 states. [2018-09-10 12:37:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:37:30,361 INFO L93 Difference]: Finished difference Result 27775 states and 37835 transitions. [2018-09-10 12:37:30,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-10 12:37:30,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 346 [2018-09-10 12:37:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:37:30,401 INFO L225 Difference]: With dead ends: 27775 [2018-09-10 12:37:30,401 INFO L226 Difference]: Without dead ends: 15422 [2018-09-10 12:37:30,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1399 GetRequests, 1379 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-09-10 12:37:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15422 states. [2018-09-10 12:37:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15422 to 15336. [2018-09-10 12:37:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15336 states. [2018-09-10 12:37:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15336 states to 15336 states and 19563 transitions. [2018-09-10 12:37:30,712 INFO L78 Accepts]: Start accepts. Automaton has 15336 states and 19563 transitions. Word has length 346 [2018-09-10 12:37:30,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:37:30,713 INFO L480 AbstractCegarLoop]: Abstraction has 15336 states and 19563 transitions. [2018-09-10 12:37:30,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 12:37:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 15336 states and 19563 transitions. [2018-09-10 12:37:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-09-10 12:37:30,722 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:37:30,723 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-09-10 12:37:30,723 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 12:37:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash 932384446, now seen corresponding path program 1 times [2018-09-10 12:37:30,724 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:37:30,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:30,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:30,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:30,725 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:37:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 242 proven. 73 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-09-10 12:37:31,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:37:31,088 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 12:37:31,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:31,098 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:37:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:31,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:37:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 346 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-10 12:37:31,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:37:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 242 proven. 73 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-09-10 12:37:32,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:37:32,251 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 12:37:32,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:32,267 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:37:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:32,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:37:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 346 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-10 12:37:32,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:37:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 242 proven. 73 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-09-10 12:37:32,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:37:32,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 12:37:32,931 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:37:32,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:37:32,932 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:37:32,932 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:37:32,933 INFO L87 Difference]: Start difference. First operand 15336 states and 19563 transitions. Second operand 9 states. [2018-09-10 12:37:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:37:44,920 INFO L93 Difference]: Finished difference Result 49722 states and 68042 transitions. [2018-09-10 12:37:44,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 12:37:44,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 350 [2018-09-10 12:37:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:37:45,060 INFO L225 Difference]: With dead ends: 49722 [2018-09-10 12:37:45,060 INFO L226 Difference]: Without dead ends: 29802 [2018-09-10 12:37:45,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1399 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-09-10 12:37:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29802 states. [2018-09-10 12:37:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29802 to 28437. [2018-09-10 12:37:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28437 states. [2018-09-10 12:37:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28437 states to 28437 states and 33402 transitions. [2018-09-10 12:37:46,075 INFO L78 Accepts]: Start accepts. Automaton has 28437 states and 33402 transitions. Word has length 350 [2018-09-10 12:37:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:37:46,075 INFO L480 AbstractCegarLoop]: Abstraction has 28437 states and 33402 transitions. [2018-09-10 12:37:46,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:37:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 28437 states and 33402 transitions. [2018-09-10 12:37:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-09-10 12:37:46,091 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:37:46,091 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:37:46,092 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 12:37:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1734470481, now seen corresponding path program 1 times [2018-09-10 12:37:46,092 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:37:46,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:46,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:46,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:37:46,094 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:37:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:46,460 WARN L175 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-10 12:37:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 256 proven. 112 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-09-10 12:37:47,543 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:37:47,544 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:37:47,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:47,562 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:37:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:47,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:37:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 348 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-09-10 12:37:48,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:37:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 348 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-09-10 12:37:48,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:37:48,443 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:37:48,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:37:48,459 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:37:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:37:48,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:37:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 348 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-09-10 12:37:48,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:37:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 348 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-09-10 12:37:48,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:37:48,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 15 [2018-09-10 12:37:48,971 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:37:48,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-10 12:37:48,972 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-10 12:37:48,973 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-10 12:37:48,973 INFO L87 Difference]: Start difference. First operand 28437 states and 33402 transitions. Second operand 11 states. [2018-09-10 12:37:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:37:59,763 INFO L93 Difference]: Finished difference Result 61187 states and 72368 transitions. [2018-09-10 12:37:59,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-10 12:37:59,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 383 [2018-09-10 12:37:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:37:59,881 INFO L225 Difference]: With dead ends: 61187 [2018-09-10 12:37:59,881 INFO L226 Difference]: Without dead ends: 32844 [2018-09-10 12:37:59,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1560 GetRequests, 1528 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-09-10 12:37:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32844 states. [2018-09-10 12:38:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32844 to 27699. [2018-09-10 12:38:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27699 states. [2018-09-10 12:38:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27699 states to 27699 states and 31065 transitions. [2018-09-10 12:38:00,502 INFO L78 Accepts]: Start accepts. Automaton has 27699 states and 31065 transitions. Word has length 383 [2018-09-10 12:38:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:38:00,503 INFO L480 AbstractCegarLoop]: Abstraction has 27699 states and 31065 transitions. [2018-09-10 12:38:00,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-10 12:38:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 27699 states and 31065 transitions. [2018-09-10 12:38:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-09-10 12:38:00,526 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:38:00,527 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:38:00,527 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 12:38:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash 815142553, now seen corresponding path program 1 times [2018-09-10 12:38:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:38:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:00,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:00,529 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:38:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 171 proven. 326 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 12:38:01,842 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:38:01,842 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:38:01,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:01,850 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:38:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:01,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:38:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-09-10 12:38:02,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:38:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 165 proven. 220 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-09-10 12:38:02,962 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:38:02,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5] total 16 [2018-09-10 12:38:02,962 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:38:02,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:38:02,963 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:38:02,963 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:38:02,964 INFO L87 Difference]: Start difference. First operand 27699 states and 31065 transitions. Second operand 5 states. [2018-09-10 12:38:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:38:08,404 INFO L93 Difference]: Finished difference Result 61114 states and 68414 transitions. [2018-09-10 12:38:08,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:38:08,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 443 [2018-09-10 12:38:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:38:08,781 INFO L225 Difference]: With dead ends: 61114 [2018-09-10 12:38:08,781 INFO L226 Difference]: Without dead ends: 33509 [2018-09-10 12:38:08,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 882 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-09-10 12:38:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33509 states. [2018-09-10 12:38:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33509 to 30536. [2018-09-10 12:38:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30536 states. [2018-09-10 12:38:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30536 states to 30536 states and 34057 transitions. [2018-09-10 12:38:09,304 INFO L78 Accepts]: Start accepts. Automaton has 30536 states and 34057 transitions. Word has length 443 [2018-09-10 12:38:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:38:09,305 INFO L480 AbstractCegarLoop]: Abstraction has 30536 states and 34057 transitions. [2018-09-10 12:38:09,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:38:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 30536 states and 34057 transitions. [2018-09-10 12:38:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-09-10 12:38:09,318 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:38:09,319 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:38:09,319 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 12:38:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1232000175, now seen corresponding path program 1 times [2018-09-10 12:38:09,320 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:38:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:09,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:09,321 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:38:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 6 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:38:09,824 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:38:09,824 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:38:09,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:09,835 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:38:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:09,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:38:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-10 12:38:10,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:38:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-10 12:38:10,318 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:38:10,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 12 [2018-09-10 12:38:10,318 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:38:10,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:38:10,319 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:38:10,319 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:38:10,320 INFO L87 Difference]: Start difference. First operand 30536 states and 34057 transitions. Second operand 3 states. [2018-09-10 12:38:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:38:13,614 INFO L93 Difference]: Finished difference Result 59623 states and 66555 transitions. [2018-09-10 12:38:13,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:38:13,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2018-09-10 12:38:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:38:13,687 INFO L225 Difference]: With dead ends: 59623 [2018-09-10 12:38:13,687 INFO L226 Difference]: Without dead ends: 29181 [2018-09-10 12:38:13,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 926 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:38:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29181 states. [2018-09-10 12:38:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29181 to 26337. [2018-09-10 12:38:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26337 states. [2018-09-10 12:38:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26337 states to 26337 states and 28932 transitions. [2018-09-10 12:38:14,155 INFO L78 Accepts]: Start accepts. Automaton has 26337 states and 28932 transitions. Word has length 461 [2018-09-10 12:38:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:38:14,155 INFO L480 AbstractCegarLoop]: Abstraction has 26337 states and 28932 transitions. [2018-09-10 12:38:14,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:38:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 26337 states and 28932 transitions. [2018-09-10 12:38:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-09-10 12:38:14,163 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:38:14,163 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:38:14,164 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 12:38:14,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1445186050, now seen corresponding path program 1 times [2018-09-10 12:38:14,164 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:38:14,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:14,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:14,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:14,165 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:38:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:15,013 WARN L175 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-10 12:38:15,372 WARN L175 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 12:38:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 245 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:38:16,393 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:38:16,393 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 12:38:16,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:16,401 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:38:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:16,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:38:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-09-10 12:38:16,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:38:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-09-10 12:38:17,074 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 12:38:17,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2018-09-10 12:38:17,075 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:38:17,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:38:17,076 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:38:17,076 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:38:17,076 INFO L87 Difference]: Start difference. First operand 26337 states and 28932 transitions. Second operand 3 states. [2018-09-10 12:38:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:38:20,401 INFO L93 Difference]: Finished difference Result 63294 states and 70719 transitions. [2018-09-10 12:38:20,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:38:20,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2018-09-10 12:38:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:38:20,498 INFO L225 Difference]: With dead ends: 63294 [2018-09-10 12:38:20,498 INFO L226 Difference]: Without dead ends: 36968 [2018-09-10 12:38:20,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1037 GetRequests, 1028 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-09-10 12:38:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36968 states. [2018-09-10 12:38:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36968 to 32762. [2018-09-10 12:38:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32762 states. [2018-09-10 12:38:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32762 states to 32762 states and 35879 transitions. [2018-09-10 12:38:21,625 INFO L78 Accepts]: Start accepts. Automaton has 32762 states and 35879 transitions. Word has length 514 [2018-09-10 12:38:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:38:21,626 INFO L480 AbstractCegarLoop]: Abstraction has 32762 states and 35879 transitions. [2018-09-10 12:38:21,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:38:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 32762 states and 35879 transitions. [2018-09-10 12:38:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2018-09-10 12:38:21,655 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:38:21,655 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:38:21,656 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 12:38:21,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2108863079, now seen corresponding path program 1 times [2018-09-10 12:38:21,657 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:38:21,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:21,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:21,658 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:38:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 235 proven. 470 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-09-10 12:38:22,511 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:38:22,511 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:38:22,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:22,519 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:38:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:22,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:38:23,337 WARN L175 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-09-10 12:38:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2018-09-10 12:38:23,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:38:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 220 proven. 366 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-09-10 12:38:24,609 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:38:24,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 12 [2018-09-10 12:38:24,610 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:38:24,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:38:24,611 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:38:24,611 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:38:24,611 INFO L87 Difference]: Start difference. First operand 32762 states and 35879 transitions. Second operand 5 states. [2018-09-10 12:38:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:38:30,708 INFO L93 Difference]: Finished difference Result 85100 states and 94542 transitions. [2018-09-10 12:38:30,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:38:30,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 751 [2018-09-10 12:38:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:38:30,812 INFO L225 Difference]: With dead ends: 85100 [2018-09-10 12:38:30,812 INFO L226 Difference]: Without dead ends: 52387 [2018-09-10 12:38:30,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1516 GetRequests, 1496 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-09-10 12:38:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52387 states. [2018-09-10 12:38:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52387 to 50173. [2018-09-10 12:38:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50173 states. [2018-09-10 12:38:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50173 states to 50173 states and 55382 transitions. [2018-09-10 12:38:31,630 INFO L78 Accepts]: Start accepts. Automaton has 50173 states and 55382 transitions. Word has length 751 [2018-09-10 12:38:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:38:31,631 INFO L480 AbstractCegarLoop]: Abstraction has 50173 states and 55382 transitions. [2018-09-10 12:38:31,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:38:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 50173 states and 55382 transitions. [2018-09-10 12:38:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280 [2018-09-10 12:38:31,672 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:38:31,673 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:38:31,674 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 12:38:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1774168465, now seen corresponding path program 1 times [2018-09-10 12:38:31,674 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:38:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:31,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:38:31,675 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:38:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 367 proven. 1198 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-09-10 12:38:36,219 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:38:36,219 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 12:38:36,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:36,227 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:38:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:36,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:38:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1159 proven. 2 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2018-09-10 12:38:37,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:38:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 545 proven. 226 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2018-09-10 12:38:40,107 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:38:40,107 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 12:38:40,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:38:40,123 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:38:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:38:41,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:38:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1159 proven. 2 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2018-09-10 12:38:41,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:38:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 545 proven. 226 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2018-09-10 12:38:43,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:38:43,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5, 5, 5] total 33 [2018-09-10 12:38:43,145 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:38:43,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-10 12:38:43,148 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-10 12:38:43,148 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2018-09-10 12:38:43,149 INFO L87 Difference]: Start difference. First operand 50173 states and 55382 transitions. Second operand 26 states. [2018-09-10 12:38:52,584 WARN L175 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-09-10 12:39:04,047 WARN L175 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-09-10 12:39:07,400 WARN L175 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-09-10 12:39:17,960 WARN L175 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-09-10 12:39:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:39:36,877 INFO L93 Difference]: Finished difference Result 122412 states and 162119 transitions. [2018-09-10 12:39:36,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-10 12:39:36,878 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1279 [2018-09-10 12:39:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:39:37,137 INFO L225 Difference]: With dead ends: 122412 [2018-09-10 12:39:37,138 INFO L226 Difference]: Without dead ends: 73689 [2018-09-10 12:39:37,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5430 GetRequests, 5230 SyntacticMatches, 2 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14959 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=5822, Invalid=33978, Unknown=0, NotChecked=0, Total=39800 [2018-09-10 12:39:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73689 states. [2018-09-10 12:39:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73689 to 69760. [2018-09-10 12:39:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69760 states. [2018-09-10 12:39:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69760 states to 69760 states and 76267 transitions. [2018-09-10 12:39:38,824 INFO L78 Accepts]: Start accepts. Automaton has 69760 states and 76267 transitions. Word has length 1279 [2018-09-10 12:39:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:39:38,825 INFO L480 AbstractCegarLoop]: Abstraction has 69760 states and 76267 transitions. [2018-09-10 12:39:38,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-10 12:39:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 69760 states and 76267 transitions. [2018-09-10 12:39:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1352 [2018-09-10 12:39:38,860 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:39:38,861 INFO L376 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:39:38,862 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 12:39:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1046453191, now seen corresponding path program 1 times [2018-09-10 12:39:38,862 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:39:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:39:38,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:39:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:39:38,864 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:39:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:39:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 661 proven. 1025 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2018-09-10 12:39:41,832 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:39:41,833 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 12:39:41,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:39:41,840 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:39:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:39:42,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:39:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1326 proven. 2 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2018-09-10 12:39:43,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:39:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 798 proven. 138 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-09-10 12:39:44,366 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:39:44,367 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 12:39:44,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:39:44,385 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:39:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:39:45,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:39:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1326 proven. 2 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2018-09-10 12:39:46,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:39:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 798 proven. 138 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-09-10 12:39:47,287 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:39:47,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5, 5, 5] total 19 [2018-09-10 12:39:47,288 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:39:47,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-10 12:39:47,290 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-10 12:39:47,290 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-09-10 12:39:47,291 INFO L87 Difference]: Start difference. First operand 69760 states and 76267 transitions. Second operand 18 states. [2018-09-10 12:40:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:40:15,966 INFO L93 Difference]: Finished difference Result 150466 states and 168727 transitions. [2018-09-10 12:40:15,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-10 12:40:15,966 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1351 [2018-09-10 12:40:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:40:16,146 INFO L225 Difference]: With dead ends: 150466 [2018-09-10 12:40:16,146 INFO L226 Difference]: Without dead ends: 76217 [2018-09-10 12:40:16,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5617 GetRequests, 5486 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5589 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1779, Invalid=13721, Unknown=0, NotChecked=0, Total=15500 [2018-09-10 12:40:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76217 states. [2018-09-10 12:40:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76217 to 71101. [2018-09-10 12:40:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71101 states. [2018-09-10 12:40:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71101 states to 71101 states and 77745 transitions. [2018-09-10 12:40:17,204 INFO L78 Accepts]: Start accepts. Automaton has 71101 states and 77745 transitions. Word has length 1351 [2018-09-10 12:40:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:40:17,205 INFO L480 AbstractCegarLoop]: Abstraction has 71101 states and 77745 transitions. [2018-09-10 12:40:17,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-10 12:40:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 71101 states and 77745 transitions. [2018-09-10 12:40:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1448 [2018-09-10 12:40:17,234 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:40:17,235 INFO L376 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:40:17,236 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 12:40:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash 726341087, now seen corresponding path program 1 times [2018-09-10 12:40:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:40:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:40:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:40:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:40:17,238 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:40:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-10 12:40:17,737 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-10 12:40:17,744 INFO L168 Benchmark]: Toolchain (without parser) took 230762.14 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 47.6 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-10 12:40:17,745 INFO L168 Benchmark]: CDTParser took 0.51 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 12:40:17,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1888.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2018-09-10 12:40:17,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 173.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-10 12:40:17,747 INFO L168 Benchmark]: Boogie Preprocessor took 642.39 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 871.4 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. [2018-09-10 12:40:17,748 INFO L168 Benchmark]: RCFGBuilder took 8363.14 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 544.9 MB). Peak memory consumption was 544.9 MB. Max. memory is 7.1 GB. [2018-09-10 12:40:17,749 INFO L168 Benchmark]: TraceAbstraction took 219687.24 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.8 GB in the beginning and 1.4 GB in the end (delta: 386.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-10 12:40:17,753 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.51 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 1888.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 173.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 642.39 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 871.4 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8363.14 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 544.9 MB). Peak memory consumption was 544.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 219687.24 ms. Allocated memory was 2.4 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.8 GB in the beginning and 1.4 GB in the end (delta: 386.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem18_label23_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_12-40-17-767.csv Completed graceful shutdown