java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 01:04:31,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 01:04:31,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 01:04:31,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 01:04:31,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 01:04:31,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 01:04:31,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 01:04:31,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 01:04:31,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 01:04:31,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 01:04:31,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 01:04:31,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 01:04:31,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 01:04:31,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 01:04:31,752 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 01:04:31,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 01:04:31,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 01:04:31,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 01:04:31,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 01:04:31,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 01:04:31,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 01:04:31,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 01:04:31,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 01:04:31,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 01:04:31,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 01:04:31,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 01:04:31,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 01:04:31,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 01:04:31,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 01:04:31,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 01:04:31,786 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 01:04:31,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 01:04:31,791 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 01:04:31,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 01:04:31,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 01:04:31,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 01:04:31,794 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 01:04:31,824 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 01:04:31,826 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 01:04:31,827 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 01:04:31,827 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 01:04:31,827 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 01:04:31,827 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 01:04:31,828 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 01:04:31,831 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 01:04:31,831 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 01:04:31,831 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 01:04:31,831 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 01:04:31,832 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 01:04:31,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 01:04:31,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 01:04:31,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 01:04:31,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 01:04:31,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 01:04:31,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 01:04:31,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 01:04:31,835 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 01:04:31,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 01:04:31,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 01:04:31,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 01:04:31,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 01:04:31,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 01:04:31,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 01:04:31,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 01:04:31,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 01:04:31,836 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 01:04:31,838 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 01:04:31,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 01:04:31,838 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 01:04:31,838 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 01:04:31,839 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 01:04:31,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 01:04:31,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 01:04:31,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 01:04:31,919 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 01:04:31,920 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 01:04:31,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-11-07 01:04:31,992 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b24f971/28f5dc03af5f418299c86984d50742d2/FLAGe8e37a9bf [2018-11-07 01:04:32,668 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 01:04:32,671 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-11-07 01:04:32,694 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b24f971/28f5dc03af5f418299c86984d50742d2/FLAGe8e37a9bf [2018-11-07 01:04:32,715 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b24f971/28f5dc03af5f418299c86984d50742d2 [2018-11-07 01:04:32,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 01:04:32,728 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 01:04:32,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 01:04:32,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 01:04:32,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 01:04:32,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:32" (1/1) ... [2018-11-07 01:04:32,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673adebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:32, skipping insertion in model container [2018-11-07 01:04:32,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:32" (1/1) ... [2018-11-07 01:04:32,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 01:04:32,818 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 01:04:33,328 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:04:33,334 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 01:04:33,445 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:04:33,466 INFO L193 MainTranslator]: Completed translation [2018-11-07 01:04:33,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33 WrapperNode [2018-11-07 01:04:33,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 01:04:33,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 01:04:33,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 01:04:33,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 01:04:33,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (1/1) ... [2018-11-07 01:04:33,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (1/1) ... [2018-11-07 01:04:33,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 01:04:33,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 01:04:33,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 01:04:33,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 01:04:33,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (1/1) ... [2018-11-07 01:04:33,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (1/1) ... [2018-11-07 01:04:33,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (1/1) ... [2018-11-07 01:04:33,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (1/1) ... [2018-11-07 01:04:33,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (1/1) ... [2018-11-07 01:04:33,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (1/1) ... [2018-11-07 01:04:33,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (1/1) ... [2018-11-07 01:04:33,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 01:04:33,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 01:04:33,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 01:04:33,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 01:04:33,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (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-11-07 01:04:33,824 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 01:04:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 01:04:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 01:04:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 01:04:33,825 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 01:04:33,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 01:04:33,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 01:04:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 01:04:33,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 01:04:36,915 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 01:04:36,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:36 BoogieIcfgContainer [2018-11-07 01:04:36,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 01:04:36,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 01:04:36,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 01:04:36,926 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 01:04:36,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:32" (1/3) ... [2018-11-07 01:04:36,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4532e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:36, skipping insertion in model container [2018-11-07 01:04:36,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:33" (2/3) ... [2018-11-07 01:04:36,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4532e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:36, skipping insertion in model container [2018-11-07 01:04:36,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:36" (3/3) ... [2018-11-07 01:04:36,932 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label45_true-unreach-call_false-termination.c [2018-11-07 01:04:36,944 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 01:04:36,956 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 01:04:36,976 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 01:04:37,023 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 01:04:37,023 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 01:04:37,024 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 01:04:37,024 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 01:04:37,024 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 01:04:37,024 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 01:04:37,025 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 01:04:37,025 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 01:04:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 01:04:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-07 01:04:37,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:04:37,073 INFO L375 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] [2018-11-07 01:04:37,075 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:04:37,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:04:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1391094344, now seen corresponding path program 1 times [2018-11-07 01:04:37,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:04:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:37,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:04:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:37,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:04:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:04:37,745 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 01:04:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:04:37,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:04:37,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 01:04:37,886 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:04:37,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 01:04:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 01:04:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:04:37,914 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 01:04:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:04:39,455 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 01:04:39,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 01:04:39,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-11-07 01:04:39,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:04:39,481 INFO L225 Difference]: With dead ends: 550 [2018-11-07 01:04:39,481 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 01:04:39,488 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:04:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 01:04:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 01:04:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 01:04:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-11-07 01:04:39,593 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 124 [2018-11-07 01:04:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:04:39,594 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-11-07 01:04:39,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 01:04:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-11-07 01:04:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 01:04:39,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:04:39,601 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 01:04:39,602 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:04:39,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:04:39,602 INFO L82 PathProgramCache]: Analyzing trace with hash -624789737, now seen corresponding path program 1 times [2018-11-07 01:04:39,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:04:39,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:39,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:04:39,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:39,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:04:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:04:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:04:39,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:04:39,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:04:39,867 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:04:39,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:04:39,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:04:39,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:04:39,870 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-11-07 01:04:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:04:41,834 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-11-07 01:04:41,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:04:41,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-07 01:04:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:04:41,846 INFO L225 Difference]: With dead ends: 1075 [2018-11-07 01:04:41,846 INFO L226 Difference]: Without dead ends: 741 [2018-11-07 01:04:41,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:04:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-07 01:04:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-11-07 01:04:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-07 01:04:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-11-07 01:04:41,916 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 135 [2018-11-07 01:04:41,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:04:41,917 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-11-07 01:04:41,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:04:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-11-07 01:04:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 01:04:41,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:04:41,922 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 01:04:41,923 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:04:41,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:04:41,923 INFO L82 PathProgramCache]: Analyzing trace with hash -39605397, now seen corresponding path program 1 times [2018-11-07 01:04:41,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:04:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:41,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:04:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:41,925 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:04:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:04:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:04:42,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:04:42,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:04:42,353 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:04:42,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:04:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:04:42,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:04:42,355 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 5 states. [2018-11-07 01:04:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:04:44,602 INFO L93 Difference]: Finished difference Result 1578 states and 2533 transitions. [2018-11-07 01:04:44,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:04:44,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2018-11-07 01:04:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:04:44,609 INFO L225 Difference]: With dead ends: 1578 [2018-11-07 01:04:44,609 INFO L226 Difference]: Without dead ends: 721 [2018-11-07 01:04:44,613 INFO L604 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-11-07 01:04:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-07 01:04:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-07 01:04:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-07 01:04:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1069 transitions. [2018-11-07 01:04:44,660 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1069 transitions. Word has length 136 [2018-11-07 01:04:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:04:44,660 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 1069 transitions. [2018-11-07 01:04:44,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:04:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1069 transitions. [2018-11-07 01:04:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 01:04:44,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:04:44,666 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:04:44,667 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:04:44,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:04:44,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1115389459, now seen corresponding path program 1 times [2018-11-07 01:04:44,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:04:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:44,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:04:44,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:44,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:04:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:04:45,462 WARN L179 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-07 01:04:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:04:45,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:04:45,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:04:45,595 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:04:45,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:04:45,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:04:45,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:04:45,597 INFO L87 Difference]: Start difference. First operand 721 states and 1069 transitions. Second operand 5 states. [2018-11-07 01:04:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:04:46,857 INFO L93 Difference]: Finished difference Result 1572 states and 2365 transitions. [2018-11-07 01:04:46,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:04:46,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-11-07 01:04:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:04:46,870 INFO L225 Difference]: With dead ends: 1572 [2018-11-07 01:04:46,871 INFO L226 Difference]: Without dead ends: 720 [2018-11-07 01:04:46,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:04:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-11-07 01:04:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-11-07 01:04:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-11-07 01:04:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1062 transitions. [2018-11-07 01:04:46,904 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1062 transitions. Word has length 137 [2018-11-07 01:04:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:04:46,905 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1062 transitions. [2018-11-07 01:04:46,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:04:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1062 transitions. [2018-11-07 01:04:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 01:04:46,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:04:46,908 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 01:04:46,909 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:04:46,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:04:46,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1083310493, now seen corresponding path program 1 times [2018-11-07 01:04:46,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:04:46,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:46,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:04:46,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:46,911 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:04:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:04:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:04:47,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:04:47,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 01:04:47,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:04:47,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 01:04:47,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 01:04:47,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:04:47,089 INFO L87 Difference]: Start difference. First operand 720 states and 1062 transitions. Second operand 3 states. [2018-11-07 01:04:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:04:48,024 INFO L93 Difference]: Finished difference Result 1882 states and 2820 transitions. [2018-11-07 01:04:48,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 01:04:48,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-11-07 01:04:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:04:48,033 INFO L225 Difference]: With dead ends: 1882 [2018-11-07 01:04:48,033 INFO L226 Difference]: Without dead ends: 1168 [2018-11-07 01:04:48,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:04:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-11-07 01:04:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1164. [2018-11-07 01:04:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-11-07 01:04:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1592 transitions. [2018-11-07 01:04:48,071 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1592 transitions. Word has length 140 [2018-11-07 01:04:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:04:48,072 INFO L480 AbstractCegarLoop]: Abstraction has 1164 states and 1592 transitions. [2018-11-07 01:04:48,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 01:04:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1592 transitions. [2018-11-07 01:04:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 01:04:48,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:04:48,079 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:04:48,079 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:04:48,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:04:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1130743534, now seen corresponding path program 1 times [2018-11-07 01:04:48,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:04:48,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:48,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:04:48,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:04:48,081 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:04:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:04:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:04:48,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 01:04:48,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 01:04:48,285 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-11-07 01:04:48,288 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [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], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 01:04:48,373 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 01:04:48,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 01:04:57,157 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 01:04:57,159 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 01:04:57,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:04:57,173 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 01:05:00,452 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 79.83% of their original sizes. [2018-11-07 01:05:00,452 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 01:05:01,742 INFO L415 sIntCurrentIteration]: We unified 171 AI predicates to 171 [2018-11-07 01:05:01,742 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 01:05:01,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 01:05:01,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-07 01:05:01,744 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:05:01,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 01:05:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 01:05:01,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 01:05:01,745 INFO L87 Difference]: Start difference. First operand 1164 states and 1592 transitions. Second operand 12 states. [2018-11-07 01:05:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:05:11,358 INFO L93 Difference]: Finished difference Result 2383 states and 3259 transitions. [2018-11-07 01:05:11,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 01:05:11,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-11-07 01:05:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:05:11,364 INFO L225 Difference]: With dead ends: 2383 [2018-11-07 01:05:11,365 INFO L226 Difference]: Without dead ends: 1225 [2018-11-07 01:05:11,369 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 01:05:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-11-07 01:05:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2018-11-07 01:05:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-07 01:05:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1658 transitions. [2018-11-07 01:05:11,408 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1658 transitions. Word has length 172 [2018-11-07 01:05:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:05:11,408 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1658 transitions. [2018-11-07 01:05:11,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 01:05:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1658 transitions. [2018-11-07 01:05:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 01:05:11,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:05:11,422 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:05:11,422 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:05:11,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:05:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -782139567, now seen corresponding path program 1 times [2018-11-07 01:05:11,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:05:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:05:11,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:05:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:05:11,426 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:05:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:05:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 01:05:11,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 01:05:11,637 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 01:05:11,637 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-07 01:05:11,638 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [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], [629], [631], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 01:05:11,645 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 01:05:11,646 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 01:05:34,453 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 01:05:34,453 INFO L272 AbstractInterpreter]: Visited 129 different actions 196 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 01:05:34,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:05:34,462 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 01:05:38,788 INFO L227 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 80.9% of their original sizes. [2018-11-07 01:05:38,788 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 01:08:49,139 INFO L415 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2018-11-07 01:08:49,140 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 01:08:49,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 01:08:49,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-07 01:08:49,140 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:08:49,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 01:08:49,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 01:08:49,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-11-07 01:08:49,142 INFO L87 Difference]: Start difference. First operand 1225 states and 1658 transitions. Second operand 22 states. Received shutdown request... [2018-11-07 01:08:54,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 01:08:54,972 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 01:08:54,979 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 01:08:54,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:08:54 BoogieIcfgContainer [2018-11-07 01:08:54,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 01:08:54,980 INFO L168 Benchmark]: Toolchain (without parser) took 262253.11 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -984.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 01:08:54,982 INFO L168 Benchmark]: CDTParser took 0.22 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-11-07 01:08:54,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.99 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-11-07 01:08:54,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.67 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-07 01:08:54,985 INFO L168 Benchmark]: Boogie Preprocessor took 113.15 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 01:08:54,985 INFO L168 Benchmark]: RCFGBuilder took 3169.47 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 7.1 GB. [2018-11-07 01:08:54,987 INFO L168 Benchmark]: TraceAbstraction took 258058.21 ms. Allocated memory was 2.2 GB in the beginning and 3.6 GB in the end (delta: 1.4 GB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -339.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 01:08:54,995 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.22 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 737.99 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 168.67 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.15 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3169.47 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 258058.21 ms. Allocated memory was 2.2 GB in the beginning and 3.6 GB in the end (delta: 1.4 GB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -339.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 527]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 527). Cancelled while BasicCegarLoop was constructing difference of abstraction (1225states) and FLOYD_HOARE automaton (currently 5 states, 22 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 257.9s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 737 SDtfs, 2149 SDslu, 469 SDs, 0 SdLazy, 3081 SolverSat, 689 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 395 GetRequests, 239 SyntacticMatches, 103 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 194.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1225occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 31.7s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9948198444133413 AbsIntWeakeningRatio, 0.21652421652421652 AbsIntAvgWeakeningVarsNumRemoved, 1947.977207977208 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1025 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1018 ConstructedInterpolants, 0 QuantifiedInterpolants, 872171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 163/180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown