java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-old.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label17_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-23 20:27:20,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 20:27:20,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 20:27:20,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 20:27:20,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 20:27:20,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 20:27:20,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 20:27:20,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 20:27:20,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 20:27:20,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 20:27:20,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 20:27:20,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 20:27:20,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 20:27:20,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 20:27:20,054 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 20:27:20,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 20:27:20,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 20:27:20,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 20:27:20,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 20:27:20,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 20:27:20,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 20:27:20,073 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 20:27:20,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 20:27:20,078 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 20:27:20,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 20:27:20,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 20:27:20,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 20:27:20,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 20:27:20,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 20:27:20,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 20:27:20,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 20:27:20,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 20:27:20,087 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 20:27:20,088 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 20:27:20,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 20:27:20,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 20:27:20,090 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-old.epf [2018-07-23 20:27:20,119 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 20:27:20,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 20:27:20,122 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-23 20:27:20,122 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-23 20:27:20,122 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-23 20:27:20,122 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-23 20:27:20,123 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-23 20:27:20,123 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-23 20:27:20,123 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-23 20:27:20,123 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-23 20:27:20,124 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-23 20:27:20,125 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-23 20:27:20,125 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-23 20:27:20,125 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-23 20:27:20,125 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-23 20:27:20,125 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-23 20:27:20,126 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-23 20:27:20,126 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-23 20:27:20,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-23 20:27:20,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 20:27:20,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-23 20:27:20,128 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-23 20:27:20,129 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-23 20:27:20,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-23 20:27:20,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 20:27:20,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-23 20:27:20,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-23 20:27:20,130 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-07-23 20:27:20,130 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-23 20:27:20,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-23 20:27:20,130 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 20:27:20,130 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-23 20:27:20,130 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-23 20:27:20,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 20:27:20,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 20:27:20,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 20:27:20,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-23 20:27:20,202 INFO L276 PluginConnector]: CDTParser initialized [2018-07-23 20:27:20,203 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label17_true-unreach-call_false-termination.c [2018-07-23 20:27:20,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454ca6435/648084e260f64bb1badec2a6c2bbdf79/FLAG655b8d645 [2018-07-23 20:27:20,879 INFO L276 CDTParser]: Found 1 translation units. [2018-07-23 20:27:20,880 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label17_true-unreach-call_false-termination.c [2018-07-23 20:27:20,907 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454ca6435/648084e260f64bb1badec2a6c2bbdf79/FLAG655b8d645 [2018-07-23 20:27:20,922 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454ca6435/648084e260f64bb1badec2a6c2bbdf79 [2018-07-23 20:27:20,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 20:27:20,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-23 20:27:20,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-23 20:27:20,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-23 20:27:20,945 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-23 20:27:20,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 08:27:20" (1/1) ... [2018-07-23 20:27:20,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76350e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:20, skipping insertion in model container [2018-07-23 20:27:20,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 08:27:20" (1/1) ... [2018-07-23 20:27:21,218 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-23 20:27:21,538 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 20:27:21,556 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-23 20:27:21,678 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 20:27:21,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21 WrapperNode [2018-07-23 20:27:21,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-23 20:27:21,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-23 20:27:21,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-23 20:27:21,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-23 20:27:21,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (1/1) ... [2018-07-23 20:27:21,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (1/1) ... [2018-07-23 20:27:21,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-23 20:27:21,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 20:27:21,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 20:27:21,818 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 20:27:21,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (1/1) ... [2018-07-23 20:27:21,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (1/1) ... [2018-07-23 20:27:21,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (1/1) ... [2018-07-23 20:27:21,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (1/1) ... [2018-07-23 20:27:21,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (1/1) ... [2018-07-23 20:27:22,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (1/1) ... [2018-07-23 20:27:22,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (1/1) ... [2018-07-23 20:27:22,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 20:27:22,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 20:27:22,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 20:27:22,104 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 20:27:22,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (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-07-23 20:27:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-07-23 20:27:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-07-23 20:27:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-23 20:27:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-23 20:27:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 20:27:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 20:27:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 20:27:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 20:27:25,738 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 20:27:25,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 08:27:25 BoogieIcfgContainer [2018-07-23 20:27:25,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 20:27:25,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 20:27:25,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 20:27:25,751 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 20:27:25,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 08:27:20" (1/3) ... [2018-07-23 20:27:25,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4d364f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 08:27:25, skipping insertion in model container [2018-07-23 20:27:25,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:27:21" (2/3) ... [2018-07-23 20:27:25,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4d364f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 08:27:25, skipping insertion in model container [2018-07-23 20:27:25,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 08:27:25" (3/3) ... [2018-07-23 20:27:25,756 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label17_true-unreach-call_false-termination.c [2018-07-23 20:27:25,771 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-23 20:27:25,781 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 20:27:25,840 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 20:27:25,841 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 20:27:25,841 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 20:27:25,841 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-23 20:27:25,841 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 20:27:25,842 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 20:27:25,842 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 20:27:25,842 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 20:27:25,842 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 20:27:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-07-23 20:27:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-23 20:27:25,888 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:25,890 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 20:27:25,890 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash -167985904, now seen corresponding path program 1 times [2018-07-23 20:27:25,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:25,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:25,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:25,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:25,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:26,533 WARN L169 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-23 20:27:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:26,624 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:26,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 20:27:26,625 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:26,632 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 20:27:26,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 20:27:26,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 20:27:26,652 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-07-23 20:27:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:28,973 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-07-23 20:27:28,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 20:27:28,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-07-23 20:27:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:29,002 INFO L225 Difference]: With dead ends: 621 [2018-07-23 20:27:29,002 INFO L226 Difference]: Without dead ends: 382 [2018-07-23 20:27:29,010 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 20:27:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-23 20:27:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-07-23 20:27:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-07-23 20:27:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-07-23 20:27:29,096 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 126 [2018-07-23 20:27:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:29,097 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-07-23 20:27:29,098 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 20:27:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-07-23 20:27:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-23 20:27:29,105 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:29,106 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-23 20:27:29,106 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash -659629669, now seen corresponding path program 1 times [2018-07-23 20:27:29,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:29,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:29,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:29,109 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:29,551 WARN L169 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-07-23 20:27:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:29,660 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:29,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 20:27:29,661 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:29,663 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 20:27:29,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 20:27:29,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:29,664 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-07-23 20:27:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:31,432 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-07-23 20:27:31,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 20:27:31,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-07-23 20:27:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:31,438 INFO L225 Difference]: With dead ends: 903 [2018-07-23 20:27:31,438 INFO L226 Difference]: Without dead ends: 381 [2018-07-23 20:27:31,443 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-07-23 20:27:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-07-23 20:27:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-23 20:27:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-07-23 20:27:31,472 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 135 [2018-07-23 20:27:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:31,472 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-07-23 20:27:31,472 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 20:27:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-07-23 20:27:31,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-23 20:27:31,476 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:31,477 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 20:27:31,477 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1684837809, now seen corresponding path program 1 times [2018-07-23 20:27:31,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:31,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:31,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:31,860 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:31,861 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 20:27:31,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:31,862 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 20:27:31,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 20:27:31,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:31,863 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-07-23 20:27:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:33,742 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-07-23 20:27:33,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 20:27:33,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-07-23 20:27:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:33,751 INFO L225 Difference]: With dead ends: 901 [2018-07-23 20:27:33,751 INFO L226 Difference]: Without dead ends: 380 [2018-07-23 20:27:33,753 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-07-23 20:27:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-07-23 20:27:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-07-23 20:27:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-07-23 20:27:33,783 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 141 [2018-07-23 20:27:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:33,783 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-07-23 20:27:33,784 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 20:27:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-07-23 20:27:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-23 20:27:33,787 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:33,787 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-23 20:27:33,787 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:33,787 INFO L82 PathProgramCache]: Analyzing trace with hash -25380136, now seen corresponding path program 1 times [2018-07-23 20:27:33,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:33,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:33,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:33,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:33,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:34,035 WARN L169 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-23 20:27:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:34,401 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:34,401 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 20:27:34,401 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:34,402 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 20:27:34,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 20:27:34,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 20:27:34,403 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-07-23 20:27:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:37,258 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-07-23 20:27:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 20:27:37,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-07-23 20:27:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:37,265 INFO L225 Difference]: With dead ends: 1193 [2018-07-23 20:27:37,265 INFO L226 Difference]: Without dead ends: 819 [2018-07-23 20:27:37,268 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-23 20:27:37,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-07-23 20:27:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-07-23 20:27:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-07-23 20:27:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-07-23 20:27:37,302 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 149 [2018-07-23 20:27:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:37,303 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-07-23 20:27:37,303 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 20:27:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-07-23 20:27:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-23 20:27:37,307 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:37,308 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 20:27:37,308 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1611058964, now seen corresponding path program 1 times [2018-07-23 20:27:37,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:37,311 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:37,690 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:37,691 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 20:27:37,691 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:37,691 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 20:27:37,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 20:27:37,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:37,692 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-07-23 20:27:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:38,934 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-07-23 20:27:38,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 20:27:38,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-07-23 20:27:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:38,953 INFO L225 Difference]: With dead ends: 1753 [2018-07-23 20:27:38,953 INFO L226 Difference]: Without dead ends: 804 [2018-07-23 20:27:38,957 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-07-23 20:27:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-07-23 20:27:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-07-23 20:27:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-07-23 20:27:38,997 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 151 [2018-07-23 20:27:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:38,998 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-07-23 20:27:38,998 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 20:27:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-07-23 20:27:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-23 20:27:39,001 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:39,002 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 20:27:39,002 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1062198448, now seen corresponding path program 1 times [2018-07-23 20:27:39,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:39,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:39,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:39,344 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:39,344 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 20:27:39,344 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:39,345 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 20:27:39,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 20:27:39,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:39,345 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-07-23 20:27:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:40,841 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-07-23 20:27:40,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 20:27:40,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2018-07-23 20:27:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:40,846 INFO L225 Difference]: With dead ends: 1747 [2018-07-23 20:27:40,846 INFO L226 Difference]: Without dead ends: 801 [2018-07-23 20:27:40,849 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:27:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-07-23 20:27:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-07-23 20:27:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-07-23 20:27:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-07-23 20:27:40,874 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 153 [2018-07-23 20:27:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:40,874 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-07-23 20:27:40,875 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 20:27:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-07-23 20:27:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-23 20:27:40,878 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:40,878 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 20:27:40,879 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash -937391160, now seen corresponding path program 1 times [2018-07-23 20:27:40,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:40,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:40,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:41,041 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:27:41,041 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 20:27:41,041 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:27:41,042 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 20:27:41,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 20:27:41,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 20:27:41,043 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-07-23 20:27:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:27:42,245 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-07-23 20:27:42,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 20:27:42,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-07-23 20:27:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:27:42,257 INFO L225 Difference]: With dead ends: 2381 [2018-07-23 20:27:42,257 INFO L226 Difference]: Without dead ends: 1586 [2018-07-23 20:27:42,262 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-23 20:27:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-07-23 20:27:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-07-23 20:27:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-07-23 20:27:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-07-23 20:27:42,327 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 157 [2018-07-23 20:27:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:27:42,327 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-07-23 20:27:42,327 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 20:27:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-07-23 20:27:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-23 20:27:42,336 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:27:42,336 INFO L353 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, 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] [2018-07-23 20:27:42,337 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 20:27:42,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1401655656, now seen corresponding path program 1 times [2018-07-23 20:27:42,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:27:42,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:42,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:27:42,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:27:42,339 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:27:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:27:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 20:27:42,824 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 20:27:42,824 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-07-23 20:27:42,825 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-07-23 20:27:42,828 INFO L201 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [20], [24], [28], [32], [36], [40], [51], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [121], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [169], [173], [177], [181], [185], [189], [193], [197], [208], [212], [216], [220], [231], [235], [239], [243], [247], [251], [255], [266], [270], [281], [285], [296], [307], [311], [315], [319], [323], [327], [331], [342], [346], [350], [354], [358], [362], [366], [370], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [677], [679], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-07-23 20:27:42,909 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-07-23 20:27:42,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-07-23 20:29:02,290 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-07-23 20:29:02,292 INFO L272 AbstractInterpreter]: Visited 130 different actions 254 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-07-23 20:29:02,299 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-07-23 20:29:17,732 INFO L232 lantSequenceWeakener]: Weakened 190 states. On average, predicates are now at 81.08% of their original sizes. [2018-07-23 20:29:17,733 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-07-23 20:29:22,338 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-07-23 20:29:22,339 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-23 20:29:22,339 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-07-23 20:29:22,339 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:29:22,340 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 20:29:22,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 20:29:22,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-07-23 20:29:22,341 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 16 states. [2018-07-23 20:29:24,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 20:29:24,383 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:148) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:86) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:370) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:141) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:127) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:309) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:343) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:240) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:641) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:570) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:367) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:119) 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-07-23 20:29:24,388 INFO L168 Benchmark]: Toolchain (without parser) took 123452.19 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 969.6 MB. Max. memory is 7.1 GB. [2018-07-23 20:29:24,389 INFO L168 Benchmark]: CDTParser took 0.23 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-07-23 20:29:24,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-23 20:29:24,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 20:29:24,391 INFO L168 Benchmark]: Boogie Preprocessor took 285.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.6 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2018-07-23 20:29:24,392 INFO L168 Benchmark]: RCFGBuilder took 3636.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 7.1 GB. [2018-07-23 20:29:24,392 INFO L168 Benchmark]: TraceAbstraction took 118645.21 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 886.0 MB. Max. memory is 7.1 GB. [2018-07-23 20:29:24,398 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.23 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 785.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 92.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 285.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.6 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3636.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118645.21 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 886.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:148) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label17_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Taipan_Default-old.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-23_20-29-24-413.csv Received shutdown request...