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_label49_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-23 20:29:41,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 20:29:41,758 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 20:29:41,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 20:29:41,779 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 20:29:41,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 20:29:41,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 20:29:41,783 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 20:29:41,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 20:29:41,786 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 20:29:41,787 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 20:29:41,787 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 20:29:41,789 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 20:29:41,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 20:29:41,793 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 20:29:41,794 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 20:29:41,795 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 20:29:41,802 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 20:29:41,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 20:29:41,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 20:29:41,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 20:29:41,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 20:29:41,820 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 20:29:41,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 20:29:41,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 20:29:41,822 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 20:29:41,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 20:29:41,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 20:29:41,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 20:29:41,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 20:29:41,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 20:29:41,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 20:29:41,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 20:29:41,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 20:29:41,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 20:29:41,834 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 20:29:41,834 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:29:41,855 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 20:29:41,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 20:29:41,856 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-23 20:29:41,856 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-23 20:29:41,856 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-23 20:29:41,857 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-23 20:29:41,857 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-23 20:29:41,857 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-23 20:29:41,857 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-23 20:29:41,862 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-23 20:29:41,862 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-23 20:29:41,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-23 20:29:41,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-23 20:29:41,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-23 20:29:41,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-23 20:29:41,865 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-23 20:29:41,865 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-23 20:29:41,866 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-23 20:29:41,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-23 20:29:41,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 20:29:41,866 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-23 20:29:41,866 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-23 20:29:41,867 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-23 20:29:41,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-23 20:29:41,867 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 20:29:41,867 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-23 20:29:41,869 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-23 20:29:41,869 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-07-23 20:29:41,869 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-23 20:29:41,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-23 20:29:41,870 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 20:29:41,870 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-23 20:29:41,870 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-23 20:29:41,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 20:29:41,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 20:29:41,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 20:29:41,968 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-23 20:29:41,968 INFO L276 PluginConnector]: CDTParser initialized [2018-07-23 20:29:41,969 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-07-23 20:29:42,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e584d06/1138584d8a0243f28b13d01fa3d7101d/FLAGa82b15a4c [2018-07-23 20:29:42,696 INFO L276 CDTParser]: Found 1 translation units. [2018-07-23 20:29:42,697 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-07-23 20:29:42,718 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e584d06/1138584d8a0243f28b13d01fa3d7101d/FLAGa82b15a4c [2018-07-23 20:29:42,733 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e584d06/1138584d8a0243f28b13d01fa3d7101d [2018-07-23 20:29:42,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 20:29:42,746 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-23 20:29:42,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-23 20:29:42,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-23 20:29:42,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-23 20:29:42,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 08:29:42" (1/1) ... [2018-07-23 20:29:42,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4d8e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:42, skipping insertion in model container [2018-07-23 20:29:42,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 08:29:42" (1/1) ... [2018-07-23 20:29:42,993 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-23 20:29:43,310 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 20:29:43,329 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-23 20:29:43,467 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 20:29:43,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43 WrapperNode [2018-07-23 20:29:43,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-23 20:29:43,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-23 20:29:43,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-23 20:29:43,510 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-23 20:29:43,521 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:29:43" (1/1) ... [2018-07-23 20:29:43,555 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:29:43" (1/1) ... [2018-07-23 20:29:43,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-23 20:29:43,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 20:29:43,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 20:29:43,635 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 20:29:43,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43" (1/1) ... [2018-07-23 20:29:43,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43" (1/1) ... [2018-07-23 20:29:43,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43" (1/1) ... [2018-07-23 20:29:43,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43" (1/1) ... [2018-07-23 20:29:43,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43" (1/1) ... [2018-07-23 20:29:43,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43" (1/1) ... [2018-07-23 20:29:43,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43" (1/1) ... [2018-07-23 20:29:43,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 20:29:43,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 20:29:43,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 20:29:43,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 20:29:43,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43" (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:29:43,956 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:29:43,957 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:29:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-23 20:29:43,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-23 20:29:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 20:29:43,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 20:29:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 20:29:43,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 20:29:47,197 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 20:29:47,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 08:29:47 BoogieIcfgContainer [2018-07-23 20:29:47,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 20:29:47,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 20:29:47,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 20:29:47,209 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 20:29:47,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 08:29:42" (1/3) ... [2018-07-23 20:29:47,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7976087d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 08:29:47, skipping insertion in model container [2018-07-23 20:29:47,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 08:29:43" (2/3) ... [2018-07-23 20:29:47,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7976087d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 08:29:47, skipping insertion in model container [2018-07-23 20:29:47,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 08:29:47" (3/3) ... [2018-07-23 20:29:47,214 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label49_true-unreach-call_false-termination.c [2018-07-23 20:29:47,226 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-23 20:29:47,235 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 20:29:47,288 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 20:29:47,289 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 20:29:47,289 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 20:29:47,289 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-23 20:29:47,290 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 20:29:47,290 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 20:29:47,290 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 20:29:47,290 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 20:29:47,290 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 20:29:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-07-23 20:29:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 20:29:47,334 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:29:47,335 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, 1, 1, 1, 1, 1, 1] [2018-07-23 20:29:47,336 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:29:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1327579656, now seen corresponding path program 1 times [2018-07-23 20:29:47,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:29:47,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:47,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:29:47,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:47,398 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:29:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:29:48,021 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:29:48,024 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:29:48,024 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 20:29:48,024 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:29:48,031 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 20:29:48,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 20:29:48,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 20:29:48,051 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-07-23 20:29:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:29:49,863 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-07-23 20:29:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 20:29:49,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-07-23 20:29:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:29:49,886 INFO L225 Difference]: With dead ends: 621 [2018-07-23 20:29:49,886 INFO L226 Difference]: Without dead ends: 382 [2018-07-23 20:29:49,894 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:29:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-23 20:29:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-07-23 20:29:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-07-23 20:29:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-07-23 20:29:49,977 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 132 [2018-07-23 20:29:49,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:29:49,978 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-07-23 20:29:49,978 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 20:29:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-07-23 20:29:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-23 20:29:49,986 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:29:49,986 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, 1, 1, 1, 1, 1, 1] [2018-07-23 20:29:49,987 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:29:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash -875525549, now seen corresponding path program 1 times [2018-07-23 20:29:49,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:29:49,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:49,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:29:49,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:49,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:29:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:29:50,417 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:29:50,417 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:29:50,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 20:29:50,418 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:29:50,420 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 20:29:50,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 20:29:50,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:29:50,422 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-07-23 20:29:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:29:52,107 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-07-23 20:29:52,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 20:29:52,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-07-23 20:29:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:29:52,114 INFO L225 Difference]: With dead ends: 903 [2018-07-23 20:29:52,114 INFO L226 Difference]: Without dead ends: 381 [2018-07-23 20:29:52,118 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 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:29:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-07-23 20:29:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-07-23 20:29:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-23 20:29:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-07-23 20:29:52,146 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 141 [2018-07-23 20:29:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:29:52,146 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-07-23 20:29:52,147 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 20:29:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-07-23 20:29:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-23 20:29:52,152 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:29:52,152 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, 1, 1, 1, 1, 1, 1] [2018-07-23 20:29:52,152 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:29:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2031434745, now seen corresponding path program 1 times [2018-07-23 20:29:52,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:29:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:52,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:29:52,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:52,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:29:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:29:52,994 WARN L169 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-07-23 20:29:53,529 WARN L169 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-07-23 20:29:53,671 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:29:53,672 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:29:53,672 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 20:29:53,672 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:29:53,673 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 20:29:53,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 20:29:53,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:29:53,674 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-07-23 20:29:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:29:55,574 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-07-23 20:29:55,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 20:29:55,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-07-23 20:29:55,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:29:55,579 INFO L225 Difference]: With dead ends: 901 [2018-07-23 20:29:55,580 INFO L226 Difference]: Without dead ends: 380 [2018-07-23 20:29:55,582 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:29:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-07-23 20:29:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-07-23 20:29:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-07-23 20:29:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-07-23 20:29:55,615 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 147 [2018-07-23 20:29:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:29:55,615 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-07-23 20:29:55,615 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 20:29:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-07-23 20:29:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-23 20:29:55,618 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:29:55,619 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, 1, 1, 1, 1, 1, 1] [2018-07-23 20:29:55,619 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:29:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1731343920, now seen corresponding path program 1 times [2018-07-23 20:29:55,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:29:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:55,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:29:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:55,622 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:29:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:29:55,851 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:29:55,852 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:29:55,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 20:29:55,852 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:29:55,853 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 20:29:55,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 20:29:55,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 20:29:55,853 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-07-23 20:29:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:29:58,611 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-07-23 20:29:58,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 20:29:58,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-07-23 20:29:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:29:58,619 INFO L225 Difference]: With dead ends: 1193 [2018-07-23 20:29:58,620 INFO L226 Difference]: Without dead ends: 819 [2018-07-23 20:29:58,622 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:29:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-07-23 20:29:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-07-23 20:29:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-07-23 20:29:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-07-23 20:29:58,663 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 155 [2018-07-23 20:29:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:29:58,663 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-07-23 20:29:58,663 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 20:29:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-07-23 20:29:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-23 20:29:58,667 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:29:58,668 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, 1, 1, 1, 1, 1, 1] [2018-07-23 20:29:58,668 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:29:58,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1922121460, now seen corresponding path program 1 times [2018-07-23 20:29:58,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:29:58,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:58,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:29:58,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:29:58,670 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:29:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:29:58,981 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:29:58,981 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:29:58,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 20:29:58,981 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:29:58,982 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 20:29:58,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 20:29:58,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:29:58,983 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-07-23 20:30:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:30:00,226 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-07-23 20:30:00,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 20:30:00,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-07-23 20:30:00,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:30:00,240 INFO L225 Difference]: With dead ends: 1753 [2018-07-23 20:30:00,240 INFO L226 Difference]: Without dead ends: 804 [2018-07-23 20:30:00,244 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:30:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-07-23 20:30:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-07-23 20:30:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-07-23 20:30:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-07-23 20:30:00,269 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 157 [2018-07-23 20:30:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:30:00,270 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-07-23 20:30:00,270 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 20:30:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-07-23 20:30:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-23 20:30:00,274 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:30:00,274 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, 1, 1, 1, 1, 1, 1] [2018-07-23 20:30:00,274 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:30:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash -54593464, now seen corresponding path program 1 times [2018-07-23 20:30:00,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:30:00,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:30:00,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:30:00,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:30:00,276 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:30:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:30:00,591 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:30:00,592 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:30:00,592 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 20:30:00,592 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:30:00,592 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 20:30:00,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 20:30:00,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 20:30:00,593 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-07-23 20:30:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:30:01,668 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-07-23 20:30:01,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 20:30:01,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-07-23 20:30:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:30:01,675 INFO L225 Difference]: With dead ends: 1747 [2018-07-23 20:30:01,675 INFO L226 Difference]: Without dead ends: 801 [2018-07-23 20:30:01,678 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:30:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-07-23 20:30:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-07-23 20:30:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-07-23 20:30:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-07-23 20:30:01,703 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 159 [2018-07-23 20:30:01,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:30:01,703 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-07-23 20:30:01,704 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 20:30:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-07-23 20:30:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-23 20:30:01,708 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:30:01,708 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, 1, 1, 1, 1, 1, 1] [2018-07-23 20:30:01,708 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:30:01,709 INFO L82 PathProgramCache]: Analyzing trace with hash 70067904, now seen corresponding path program 1 times [2018-07-23 20:30:01,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:30:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:30:01,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:30:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:30:01,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:30:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:30:01,941 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-07-23 20:30:02,341 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:30:02,341 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 20:30:02,341 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 20:30:02,342 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:30:02,342 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 20:30:02,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 20:30:02,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 20:30:02,343 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-07-23 20:30:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 20:30:04,015 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-07-23 20:30:04,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 20:30:04,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-07-23 20:30:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 20:30:04,028 INFO L225 Difference]: With dead ends: 2381 [2018-07-23 20:30:04,028 INFO L226 Difference]: Without dead ends: 1586 [2018-07-23 20:30:04,033 INFO L573 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-07-23 20:30:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-07-23 20:30:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-07-23 20:30:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-07-23 20:30:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-07-23 20:30:04,083 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 163 [2018-07-23 20:30:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 20:30:04,084 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-07-23 20:30:04,084 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 20:30:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-07-23 20:30:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-23 20:30:04,091 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 20:30:04,091 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, 1, 1, 1, 1, 1, 1] [2018-07-23 20:30:04,091 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:30:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1503636880, now seen corresponding path program 1 times [2018-07-23 20:30:04,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 20:30:04,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:30:04,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 20:30:04,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 20:30:04,093 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 20:30:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 20:30:04,565 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:30:04,566 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 20:30:04,566 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-07-23 20:30:04,567 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-07-23 20:30:04,569 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], [681], [689], [697], [705], [713], [721], [725], [727], [861], [862], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-07-23 20:30:04,693 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-07-23 20:30:04,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-07-23 20:31:35,136 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-07-23 20:31:35,138 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 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:31:35,150 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-07-23 20:31:49,596 INFO L232 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 81.15% of their original sizes. [2018-07-23 20:31:49,596 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-07-23 20:31:54,076 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-07-23 20:31:54,077 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-23 20:31:54,078 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-07-23 20:31:54,078 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 20:31:54,079 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 20:31:54,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 20:31:54,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-07-23 20:31:54,080 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 16 states. [2018-07-23 20:31:55,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 20:31:55,765 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:31:55,772 INFO L168 Benchmark]: Toolchain (without parser) took 133026.91 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 1.5 GB in the end (delta: -71.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 20:31:55,773 INFO L168 Benchmark]: CDTParser took 0.25 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:31:55,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.32 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-07-23 20:31:55,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.02 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:31:55,776 INFO L168 Benchmark]: Boogie Preprocessor took 240.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -835.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. [2018-07-23 20:31:55,777 INFO L168 Benchmark]: RCFGBuilder took 3323.30 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: 108.2 MB). Peak memory consumption was 108.2 MB. Max. memory is 7.1 GB. [2018-07-23 20:31:55,779 INFO L168 Benchmark]: TraceAbstraction took 128570.32 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 1.5 GB in the end (delta: 610.7 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-07-23 20:31:55,786 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.25 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. * CACSL2BoogieTranslator took 762.32 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 124.02 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 240.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -835.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3323.30 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: 108.2 MB). Peak memory consumption was 108.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 128570.32 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 1.5 GB in the end (delta: 610.7 MB). Peak memory consumption was 2.5 GB. 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_label49_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Taipan_Default-old.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-23_20-31-55-804.csv Received shutdown request...