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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/zonotope_loose_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:52:10,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:52:10,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:52:10,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:52:10,651 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:52:10,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:52:10,654 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:52:10,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:52:10,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:52:10,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:52:10,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:52:10,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:52:10,670 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:52:10,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:52:10,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:52:10,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:52:10,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:52:10,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:52:10,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:52:10,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:52:10,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:52:10,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:52:10,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:52:10,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:52:10,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:52:10,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:52:10,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:52:10,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:52:10,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:52:10,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:52:10,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:52:10,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:52:10,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:52:10,693 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:52:10,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:52:10,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:52:10,695 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:52:10,711 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:52:10,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:52:10,712 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:52:10,712 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:52:10,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:52:10,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:52:10,713 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:52:10,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:52:10,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:52:10,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:52:10,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:52:10,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:52:10,714 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:52:10,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:52:10,715 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:52:10,715 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:52:10,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:52:10,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:52:10,716 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:52:10,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:52:10,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:52:10,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:52:10,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:52:10,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:52:10,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:52:10,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:52:10,717 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:52:10,717 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:52:10,718 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:52:10,718 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:52:10,718 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:52:10,718 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:52:10,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:52:10,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:52:10,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:52:10,785 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:52:10,786 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:52:10,787 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_loose_true-unreach-call_true-termination.c [2018-09-19 15:52:11,140 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156210c5f/4dc567f35cb34c919ed970619e91a6c3/FLAG91a25cd63 [2018-09-19 15:52:11,355 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:52:11,356 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_loose_true-unreach-call_true-termination.c [2018-09-19 15:52:11,365 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156210c5f/4dc567f35cb34c919ed970619e91a6c3/FLAG91a25cd63 [2018-09-19 15:52:11,392 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156210c5f/4dc567f35cb34c919ed970619e91a6c3 [2018-09-19 15:52:11,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:52:11,410 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:52:11,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:52:11,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:52:11,423 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:52:11,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:52:11" (1/1) ... [2018-09-19 15:52:11,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2872e34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11, skipping insertion in model container [2018-09-19 15:52:11,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:52:11" (1/1) ... [2018-09-19 15:52:11,441 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:52:11,660 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:52:11,682 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:52:11,688 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:52:11,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11 WrapperNode [2018-09-19 15:52:11,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:52:11,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:52:11,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:52:11,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:52:11,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11" (1/1) ... [2018-09-19 15:52:11,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11" (1/1) ... [2018-09-19 15:52:11,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11" (1/1) ... [2018-09-19 15:52:11,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11" (1/1) ... [2018-09-19 15:52:11,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11" (1/1) ... [2018-09-19 15:52:11,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11" (1/1) ... [2018-09-19 15:52:11,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11" (1/1) ... [2018-09-19 15:52:11,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:52:11,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:52:11,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:52:11,743 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:52:11,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:52:11,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:52:11,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:52:11,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:52:11,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:52:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:52:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 15:52:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:52:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:52:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:52:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:52:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:52:15,735 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:52:15,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:52:15 BoogieIcfgContainer [2018-09-19 15:52:15,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:52:15,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:52:15,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:52:15,741 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:52:15,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:52:11" (1/3) ... [2018-09-19 15:52:15,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288ff0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:52:15, skipping insertion in model container [2018-09-19 15:52:15,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:52:11" (2/3) ... [2018-09-19 15:52:15,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288ff0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:52:15, skipping insertion in model container [2018-09-19 15:52:15,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:52:15" (3/3) ... [2018-09-19 15:52:15,745 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_loose_true-unreach-call_true-termination.c [2018-09-19 15:52:15,756 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:52:15,765 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:52:15,814 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:52:15,815 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:52:15,815 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:52:15,815 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:52:15,815 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:52:15,815 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:52:15,817 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:52:15,817 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:52:15,817 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:52:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-19 15:52:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-19 15:52:15,841 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:52:15,842 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:52:15,845 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:52:15,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1736771137, now seen corresponding path program 1 times [2018-09-19 15:52:15,856 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:52:15,856 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:52:15,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:52:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:52:16,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:52:18,870 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 10.0))) (and (fp.leq main_~x~0 .cse0) (fp.geq main_~x~0 (_ +zero 11 53)) (= (fp.div RNE main_~x~0 .cse0) c_main_~y~0)))) is different from false [2018-09-19 15:52:21,079 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 10.0))) (and (fp.leq main_~x~0 .cse0) (fp.geq main_~x~0 (_ +zero 11 53)) (= (fp.div RNE main_~x~0 .cse0) c_main_~y~0)))) is different from true [2018-09-19 15:52:36,698 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 10.0))) (and (not (fp.geq (fp.div RNE main_~x~0 .cse1) (_ +zero 11 53))) (fp.leq main_~x~0 .cse1) (fp.geq main_~x~0 (_ +zero 11 53)))))) (and (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 10.0))) (and (not (fp.leq (fp.div RNE v_prenex_1 .cse2) ((_ to_fp 11 53) RNE 105.0))) (fp.leq v_prenex_1 .cse2) (fp.geq v_prenex_1 (_ +zero 11 53))))) .cse0) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-09-19 15:52:48,160 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 10.0))) (and (not (fp.leq (fp.div RNE v_prenex_1 .cse1) ((_ to_fp 11 53) RNE 105.0))) (fp.leq v_prenex_1 .cse1) (fp.geq v_prenex_1 (_ +zero 11 53)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (and .cse0 (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 10.0))) (and (not (fp.geq (fp.div RNE main_~x~0 .cse2) (_ +zero 11 53))) (fp.leq main_~x~0 .cse2) (fp.geq main_~x~0 (_ +zero 11 53)))))))) is different from false [2018-09-19 15:52:59,666 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 10.0))) (and (not (fp.leq (fp.div RNE v_prenex_1 .cse0) ((_ to_fp 11 53) RNE 105.0))) (fp.leq v_prenex_1 .cse0) (fp.geq v_prenex_1 (_ +zero 11 53))))) (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 10.0))) (and (not (fp.geq (fp.div RNE main_~x~0 .cse1) (_ +zero 11 53))) (fp.leq main_~x~0 .cse1) (fp.geq main_~x~0 (_ +zero 11 53)))))) is different from false [2018-09-19 15:53:01,908 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 10.0))) (and (not (fp.leq (fp.div RNE v_prenex_1 .cse0) ((_ to_fp 11 53) RNE 105.0))) (fp.leq v_prenex_1 .cse0) (fp.geq v_prenex_1 (_ +zero 11 53))))) (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 10.0))) (and (not (fp.geq (fp.div RNE main_~x~0 .cse1) (_ +zero 11 53))) (fp.leq main_~x~0 .cse1) (fp.geq main_~x~0 (_ +zero 11 53)))))) is different from true [2018-09-19 15:53:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:53:01,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:53:01,946 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:53:01,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 15:53:01,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 15:53:01,965 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 15:53:01,966 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-09-19 15:53:01,969 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-09-19 15:53:06,642 WARN L797 $PredicateComparison]: unable to prove that (and (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 10.0))) (and (fp.leq main_~x~0 .cse0) (fp.geq main_~x~0 (_ +zero 11 53)) (= (fp.div RNE main_~x~0 .cse0) c_main_~y~0)))) (fp.leq c_main_~x~0 ((_ to_fp 11 53) RNE 10.0)) (fp.geq c_main_~x~0 (_ +zero 11 53))) is different from false [2018-09-19 15:53:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:53:08,759 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-09-19 15:53:08,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 15:53:08,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-19 15:53:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:53:08,833 INFO L225 Difference]: With dead ends: 30 [2018-09-19 15:53:08,833 INFO L226 Difference]: Without dead ends: 11 [2018-09-19 15:53:08,836 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=13, Invalid=6, Unknown=7, NotChecked=30, Total=56 [2018-09-19 15:53:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-19 15:53:08,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-19 15:53:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-19 15:53:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 10 transitions. [2018-09-19 15:53:08,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 10 transitions. Word has length 10 [2018-09-19 15:53:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:53:08,880 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 10 transitions. [2018-09-19 15:53:08,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 15:53:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2018-09-19 15:53:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-19 15:53:08,881 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:53:08,881 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:53:08,882 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:53:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1734924095, now seen corresponding path program 1 times [2018-09-19 15:53:08,884 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:53:08,884 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:53:08,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:53:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:53:09,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:53:23,719 WARN L178 SmtUtils]: Spent 12.30 s on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 15:53:25,811 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul RNE main_~x~0 main_~x~0))) (and (= (fp.add RNE .cse0 ((_ to_fp 11 53) RNE 2.0)) c_main_~y~0) (fp.leq main_~x~0 ((_ to_fp 11 53) RNE 10.0)) (fp.geq main_~x~0 (_ +zero 11 53)) (not (fp.geq (fp.sub RNE .cse0 main_~x~0) ((_ to_fp 11 53) RNE (_ bv0 32))))))) is different from false [2018-09-19 15:53:27,888 WARN L819 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul RNE main_~x~0 main_~x~0))) (and (= (fp.add RNE .cse0 ((_ to_fp 11 53) RNE 2.0)) c_main_~y~0) (fp.leq main_~x~0 ((_ to_fp 11 53) RNE 10.0)) (fp.geq main_~x~0 (_ +zero 11 53)) (not (fp.geq (fp.sub RNE .cse0 main_~x~0) ((_ to_fp 11 53) RNE (_ bv0 32))))))) is different from true [2018-09-19 15:53:44,552 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul RNE v_prenex_5 v_prenex_5))) (and (not (fp.geq (fp.sub RNE .cse1 v_prenex_5) ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq v_prenex_5 ((_ to_fp 11 53) RNE 10.0)) (fp.geq v_prenex_5 (_ +zero 11 53)) (not (fp.geq (fp.add RNE .cse1 ((_ to_fp 11 53) RNE 2.0)) (_ +zero 11 53))))))) (and (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.mul RNE v_prenex_3 v_prenex_3))) (and (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 10.0)) (not (fp.leq (fp.add RNE .cse2 ((_ to_fp 11 53) RNE 2.0)) ((_ to_fp 11 53) RNE 105.0))) (fp.geq v_prenex_3 (_ +zero 11 53)) (not (fp.geq (fp.sub RNE .cse2 v_prenex_3) ((_ to_fp 11 53) RNE (_ bv0 32))))))) .cse0) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse4 (fp.mul RNE main_~x~0 main_~x~0))) (let ((.cse3 (fp.add RNE .cse4 ((_ to_fp 11 53) RNE 2.0)))) (and (fp.leq main_~x~0 ((_ to_fp 11 53) RNE 10.0)) (fp.geq .cse3 (_ +zero 11 53)) (fp.geq main_~x~0 (_ +zero 11 53)) (fp.leq .cse3 ((_ to_fp 11 53) RNE 105.0)) (not (fp.geq (fp.sub RNE .cse4 main_~x~0) ((_ to_fp 11 53) RNE (_ bv0 32))))))))))) is different from false [2018-09-19 15:53:59,186 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul RNE main_~x~0 main_~x~0))) (let ((.cse0 (fp.add RNE .cse1 ((_ to_fp 11 53) RNE 2.0)))) (and (fp.leq main_~x~0 ((_ to_fp 11 53) RNE 10.0)) (fp.geq .cse0 (_ +zero 11 53)) (fp.geq main_~x~0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) RNE 105.0)) (not (fp.geq (fp.sub RNE .cse1 main_~x~0) ((_ to_fp 11 53) RNE (_ bv0 32)))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse2 (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse3 (fp.mul RNE v_prenex_5 v_prenex_5))) (and (not (fp.geq (fp.sub RNE .cse3 v_prenex_5) ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq v_prenex_5 ((_ to_fp 11 53) RNE 10.0)) (fp.geq v_prenex_5 (_ +zero 11 53)) (not (fp.geq (fp.add RNE .cse3 ((_ to_fp 11 53) RNE 2.0)) (_ +zero 11 53))))))) (and .cse2 (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse4 (fp.mul RNE v_prenex_3 v_prenex_3))) (and (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 10.0)) (not (fp.leq (fp.add RNE .cse4 ((_ to_fp 11 53) RNE 2.0)) ((_ to_fp 11 53) RNE 105.0))) (fp.geq v_prenex_3 (_ +zero 11 53)) (not (fp.geq (fp.sub RNE .cse4 v_prenex_3) ((_ to_fp 11 53) RNE (_ bv0 32)))))))))) is different from false [2018-09-19 15:54:09,608 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul RNE v_prenex_3 v_prenex_3))) (and (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 10.0)) (not (fp.leq (fp.add RNE .cse0 ((_ to_fp 11 53) RNE 2.0)) ((_ to_fp 11 53) RNE 105.0))) (fp.geq v_prenex_3 (_ +zero 11 53)) (not (fp.geq (fp.sub RNE .cse0 v_prenex_3) ((_ to_fp 11 53) RNE (_ bv0 32))))))) (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul RNE v_prenex_5 v_prenex_5))) (and (not (fp.geq (fp.sub RNE .cse1 v_prenex_5) ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq v_prenex_5 ((_ to_fp 11 53) RNE 10.0)) (fp.geq v_prenex_5 (_ +zero 11 53)) (not (fp.geq (fp.add RNE .cse1 ((_ to_fp 11 53) RNE 2.0)) (_ +zero 11 53))))))) is different from false [2018-09-19 15:54:11,662 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul RNE v_prenex_3 v_prenex_3))) (and (fp.leq v_prenex_3 ((_ to_fp 11 53) RNE 10.0)) (not (fp.leq (fp.add RNE .cse0 ((_ to_fp 11 53) RNE 2.0)) ((_ to_fp 11 53) RNE 105.0))) (fp.geq v_prenex_3 (_ +zero 11 53)) (not (fp.geq (fp.sub RNE .cse0 v_prenex_3) ((_ to_fp 11 53) RNE (_ bv0 32))))))) (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul RNE v_prenex_5 v_prenex_5))) (and (not (fp.geq (fp.sub RNE .cse1 v_prenex_5) ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.leq v_prenex_5 ((_ to_fp 11 53) RNE 10.0)) (fp.geq v_prenex_5 (_ +zero 11 53)) (not (fp.geq (fp.add RNE .cse1 ((_ to_fp 11 53) RNE 2.0)) (_ +zero 11 53))))))) is different from true [2018-09-19 15:54:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:54:11,665 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:54:11,679 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:54:11,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 15:54:11,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 15:54:11,681 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 15:54:11,683 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-09-19 15:54:11,683 INFO L87 Difference]: Start difference. First operand 11 states and 10 transitions. Second operand 7 states. [2018-09-19 15:54:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:54:13,808 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2018-09-19 15:54:13,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 15:54:13,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-19 15:54:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:54:13,875 INFO L225 Difference]: With dead ends: 11 [2018-09-19 15:54:13,875 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 15:54:13,877 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=11, Invalid=5, Unknown=6, NotChecked=20, Total=42 [2018-09-19 15:54:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 15:54:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 15:54:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 15:54:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 15:54:13,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2018-09-19 15:54:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:54:13,878 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 15:54:13,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 15:54:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 15:54:13,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 15:54:13,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 15:54:37,944 WARN L178 SmtUtils]: Spent 23.98 s on a formula simplification that was a NOOP. DAG size: 26 [2018-09-19 15:54:46,130 WARN L178 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 101 DAG size of output: 1 [2018-09-19 15:54:46,132 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-19 15:54:46,132 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 15:54:46,132 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 15:54:46,132 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-19 15:54:46,133 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 15:54:46,133 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 15:54:46,133 INFO L422 ceAbstractionStarter]: At program point L19-2(lines 19 20) the Hoare annotation is: (or (and (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 10.0))) (and (fp.leq main_~x~0 .cse0) (fp.geq main_~x~0 (_ +zero 11 53)) (= (fp.div RNE main_~x~0 .cse0) main_~y~0)))) (fp.leq main_~x~0 ((_ to_fp 11 53) RNE 10.0)) (fp.geq main_~x~0 (_ +zero 11 53))) (exists ((main_~x~0 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul RNE main_~x~0 main_~x~0))) (and (= (fp.add RNE .cse1 ((_ to_fp 11 53) RNE 2.0)) main_~y~0) (fp.leq main_~x~0 ((_ to_fp 11 53) RNE 10.0)) (fp.geq main_~x~0 (_ +zero 11 53)) (not (fp.geq (fp.sub RNE .cse1 main_~x~0) ((_ to_fp 11 53) RNE (_ bv0 32)))))))) [2018-09-19 15:54:46,134 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 11 24) the Hoare annotation is: true [2018-09-19 15:54:46,134 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 11 24) no Hoare annotation was computed. [2018-09-19 15:54:46,134 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 11 24) no Hoare annotation was computed. [2018-09-19 15:54:46,134 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-19 15:54:46,134 INFO L426 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2018-09-19 15:54:46,135 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 9) the Hoare annotation is: true [2018-09-19 15:54:46,135 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-09-19 15:54:46,135 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 9) no Hoare annotation was computed. [2018-09-19 15:54:46,135 INFO L426 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2018-09-19 15:54:46,135 INFO L426 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-09-19 15:54:46,136 INFO L426 ceAbstractionStarter]: For program point L9-3(line 9) no Hoare annotation was computed. [2018-09-19 15:54:46,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:54:46 BoogieIcfgContainer [2018-09-19 15:54:46,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:54:46,140 INFO L168 Benchmark]: Toolchain (without parser) took 154734.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -699.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. [2018-09-19 15:54:46,142 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:54:46,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.00 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:54:46,143 INFO L168 Benchmark]: Boogie Preprocessor took 35.67 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-09-19 15:54:46,144 INFO L168 Benchmark]: RCFGBuilder took 3994.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.7 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-09-19 15:54:46,145 INFO L168 Benchmark]: TraceAbstraction took 150401.89 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: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:54:46,150 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.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.00 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.67 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. * RCFGBuilder took 3994.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.7 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 150401.89 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: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 150.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 32.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 1 SDslu, 56 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 7 PreInvPairs, 8 NumberOfFragments, 66 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 381 FormulaSimplificationTreeSizeReductionInter, 32.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 107.6s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 8 QuantifiedInterpolants, 5112 SizeOfPredicates, 6 NumberOfNonLiveVariables, 44 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...