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/sqrt_Householder_pseudoconstant_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:50:02,455 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:50:02,457 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:50:02,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:50:02,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:50:02,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:50:02,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:50:02,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:50:02,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:50:02,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:50:02,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:50:02,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:50:02,481 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:50:02,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:50:02,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:50:02,485 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:50:02,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:50:02,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:50:02,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:50:02,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:50:02,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:50:02,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:50:02,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:50:02,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:50:02,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:50:02,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:50:02,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:50:02,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:50:02,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:50:02,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:50:02,503 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:50:02,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:50:02,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:50:02,505 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:50:02,506 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:50:02,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:50:02,507 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:50:02,524 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:50:02,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:50:02,525 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:50:02,525 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:50:02,526 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:50:02,526 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:50:02,526 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:50:02,527 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:50:02,528 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:50:02,528 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:50:02,529 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:50:02,529 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:50:02,529 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:50:02,529 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:50:02,529 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:50:02,530 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:50:02,530 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:50:02,530 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:50:02,530 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:50:02,530 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:50:02,531 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:50:02,531 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:50:02,531 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:50:02,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:50:02,531 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:50:02,531 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:50:02,532 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:50:02,532 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:50:02,532 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:50:02,532 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:50:02,533 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:50:02,533 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:50:02,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:50:02,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:50:02,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:50:02,599 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:50:02,600 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:50:02,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_pseudoconstant_true-unreach-call.c [2018-09-19 15:50:02,955 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda1c2ec5/c6909683199d4159a04d599b402e908c/FLAG072c0447c [2018-09-19 15:50:03,128 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:50:03,129 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Householder_pseudoconstant_true-unreach-call.c [2018-09-19 15:50:03,137 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda1c2ec5/c6909683199d4159a04d599b402e908c/FLAG072c0447c [2018-09-19 15:50:03,154 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda1c2ec5/c6909683199d4159a04d599b402e908c [2018-09-19 15:50:03,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:50:03,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:50:03,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:50:03,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:50:03,181 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:50:03,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:50:03" (1/1) ... [2018-09-19 15:50:03,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ccd763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03, skipping insertion in model container [2018-09-19 15:50:03,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:50:03" (1/1) ... [2018-09-19 15:50:03,199 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:50:03,448 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:50:03,470 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:50:03,485 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:50:03,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03 WrapperNode [2018-09-19 15:50:03,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:50:03,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:50:03,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:50:03,507 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:50:03,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03" (1/1) ... [2018-09-19 15:50:03,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03" (1/1) ... [2018-09-19 15:50:03,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03" (1/1) ... [2018-09-19 15:50:03,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03" (1/1) ... [2018-09-19 15:50:03,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03" (1/1) ... [2018-09-19 15:50:03,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03" (1/1) ... [2018-09-19 15:50:03,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03" (1/1) ... [2018-09-19 15:50:03,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:50:03,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:50:03,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:50:03,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:50:03,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03" (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:50:03,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:50:03,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:50:03,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-19 15:50:03,635 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-09-19 15:50:03,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:50:03,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:50:03,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 15:50:03,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-19 15:50:03,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-19 15:50:03,636 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-09-19 15:50:03,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:50:03,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:50:03,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:50:14,258 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:50:14,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:50:14 BoogieIcfgContainer [2018-09-19 15:50:14,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:50:14,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:50:14,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:50:14,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:50:14,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:50:03" (1/3) ... [2018-09-19 15:50:14,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebc80fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:50:14, skipping insertion in model container [2018-09-19 15:50:14,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:50:03" (2/3) ... [2018-09-19 15:50:14,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebc80fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:50:14, skipping insertion in model container [2018-09-19 15:50:14,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:50:14" (3/3) ... [2018-09-19 15:50:14,268 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_pseudoconstant_true-unreach-call.c [2018-09-19 15:50:14,278 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:50:14,287 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:50:14,333 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:50:14,333 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:50:14,333 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:50:14,334 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:50:14,334 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:50:14,334 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:50:14,334 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:50:14,334 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:50:14,335 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:50:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-19 15:50:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-19 15:50:14,361 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:14,362 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:50:14,365 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:14,371 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-09-19 15:50:14,376 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:14,377 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) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 15:50:14,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:50:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:16,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:16,137 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:50:16,137 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:50:16,169 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:50:16,169 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:50:16,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:50:16,186 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:50:16,187 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:50:16,190 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-09-19 15:50:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:50:16,219 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-09-19 15:50:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:50:16,220 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-19 15:50:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:50:16,229 INFO L225 Difference]: With dead ends: 56 [2018-09-19 15:50:16,229 INFO L226 Difference]: Without dead ends: 26 [2018-09-19 15:50:16,233 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:50:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-19 15:50:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-19 15:50:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-19 15:50:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-19 15:50:16,274 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-09-19 15:50:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:50:16,274 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-19 15:50:16,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:50:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-19 15:50:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-19 15:50:16,276 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:16,276 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:50:16,277 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:16,277 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-09-19 15:50:16,278 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:16,279 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) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 15:50:16,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:50:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:17,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:29,018 WARN L178 SmtUtils]: Spent 9.18 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-09-19 15:50:29,024 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:50:29,025 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:50:29,054 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:50:29,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 15:50:29,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 15:50:29,058 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 15:50:29,058 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:50:29,059 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-09-19 15:50:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:50:36,614 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-09-19 15:50:36,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 15:50:36,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-09-19 15:50:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:50:36,617 INFO L225 Difference]: With dead ends: 49 [2018-09-19 15:50:36,617 INFO L226 Difference]: Without dead ends: 29 [2018-09-19 15:50:36,618 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 15:50:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-19 15:50:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-19 15:50:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-19 15:50:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-09-19 15:50:36,626 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-09-19 15:50:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:50:36,626 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-09-19 15:50:36,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 15:50:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-09-19 15:50:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-19 15:50:36,628 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:50:36,628 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:50:36,628 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:50:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash 502189223, now seen corresponding path program 1 times [2018-09-19 15:50:36,629 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:50:36,629 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 15:50:36,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 15:50:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:50:41,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:50:41,871 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 15:50:44,448 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (= (fp.div RNE .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xn~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)))) is different from false [2018-09-19 15:50:46,968 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (= (_ bv1 32) c_SqrtR_~cond~0)) (.cse4 (let ((.cse6 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse6) (fp.mul RNE c_~_EPS~0 .cse6)))) (.cse0 (= (fp.div RNE .cse5 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0)) (.cse1 (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)) (.cse2 (not (fp.leq |c_SqrtR_#in~Input| .cse5)))) (or (and .cse0 .cse1 (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) v_prenex_2)) .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2 .cse3) (and (not .cse4) .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= (_ bv0 32) c_SqrtR_~cond~0) .cse1 .cse2)))) is different from false [2018-09-19 15:50:49,507 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (= (_ bv1 32) c_SqrtR_~cond~0)) (.cse4 (let ((.cse6 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse6) (fp.mul RNE c_~_EPS~0 .cse6)))) (.cse0 (= (fp.div RNE .cse5 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0)) (.cse1 (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)) (.cse2 (not (fp.leq |c_SqrtR_#in~Input| .cse5)))) (or (and .cse0 .cse1 (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) v_prenex_2)) .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2 .cse3) (and (not .cse4) .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= (_ bv0 32) c_SqrtR_~cond~0) .cse1 .cse2)))) is different from true [2018-09-19 15:50:51,962 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (not (let ((.cse0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0)))) (= (fp.div RNE .cse1 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse1)))) is different from false [2018-09-19 15:50:54,074 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (not (let ((.cse0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse0) (fp.mul RNE c_~_EPS~0 .cse0)))) (= (fp.div RNE .cse1 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse1)))) is different from true [2018-09-19 15:50:56,930 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 |c_SqrtR_#in~Input|))) (and (= (fp.div RNE .cse0 .cse1) |c_SqrtR_#res|) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (let ((.cse2 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) |c_SqrtR_#in~Input|))) (fp.add RNE .cse2 .cse2))) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (not (let ((.cse3 (fp.add RNE .cse1 .cse1))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse3) (fp.mul RNE c_~_EPS~0 .cse3))))))) is different from false [2018-09-19 15:50:59,549 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 |c_SqrtR_#in~Input|))) (and (= (fp.div RNE .cse0 .cse1) |c_SqrtR_#res|) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) (let ((.cse2 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) |c_SqrtR_#in~Input|))) (fp.add RNE .cse2 .cse2))) SqrtR_~linf~0))) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (not (let ((.cse3 (fp.add RNE .cse1 .cse1))) (fp.gt (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) c_~_EPS~0) .cse3) (fp.mul RNE c_~_EPS~0 .cse3))))))) is different from true [2018-09-19 15:51:02,434 WARN L797 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse3 .cse3))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse1 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (not (fp.lt .cse1 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse2)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse2)) (= |c_main_#t~ret3| (fp.div RNE .cse0 .cse3)) (not (fp.gt .cse1 (fp.mul RNE .cse4 .cse5))))))))) is different from false [2018-09-19 15:51:05,128 WARN L819 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse3 .cse3))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse1 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (not (fp.lt .cse1 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse2)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse2)) (= |c_main_#t~ret3| (fp.div RNE .cse0 .cse3)) (not (fp.gt .cse1 (fp.mul RNE .cse4 .cse5))))))))) is different from true [2018-09-19 15:51:08,010 WARN L797 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse3 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (= (fp.div RNE .cse0 .cse1) c_main_~r~0) (not (fp.lt .cse2 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse3)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse3)) (not (fp.gt .cse2 (fp.mul RNE .cse4 .cse5))))))))) is different from false [2018-09-19 15:51:10,731 WARN L819 $PredicateComparison]: unable to prove that (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 main_~dd~0))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse3 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse2 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.leq main_~dd~0 .cse0)) (= (fp.div RNE .cse0 .cse1) c_main_~r~0) (not (fp.lt .cse2 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse0 .cse3)) (fp.leq main_~dd~0 (fp.add RNE .cse0 .cse3)) (not (fp.gt .cse2 (fp.mul RNE .cse4 .cse5))))))))) is different from true [2018-09-19 15:51:34,246 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse1 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse6 (fp.add RNE .cse2 .cse2))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse5) .cse6))) (and (not (fp.leq (fp.div RNE .cse1 .cse2) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse1)) (not (fp.lt .cse3 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse1 .cse4)) (fp.leq main_~dd~0 (fp.add RNE .cse1 .cse4)) (not (fp.gt .cse3 (fp.mul RNE .cse5 .cse6)))))))))) (and (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse8 (fp.div RNE .cse7 v_prenex_4))) (let ((.cse11 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse12 (fp.add RNE .cse8 .cse8))) (let ((.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse10 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse11) .cse12))) (and (not (fp.geq (fp.div RNE .cse7 .cse8) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse7 .cse9)) (not (fp.gt .cse10 (fp.mul RNE .cse11 .cse12))) (fp.leq v_prenex_4 (fp.add RNE .cse7 .cse9)) (not (fp.lt .cse10 v_prenex_3)) (not (fp.leq v_prenex_4 .cse7)))))))) .cse0) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse19 (fp.div RNE .cse14 v_prenex_7))) (let ((.cse17 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse18 (fp.add RNE .cse19 .cse19))) (let ((.cse16 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse17) .cse18)) (.cse15 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse13 (fp.div RNE .cse14 .cse19))) (and (fp.leq .cse13 ((_ to_fp 11 53) RNE 5.0)) (not (fp.leq v_prenex_7 .cse14)) (fp.leq v_prenex_7 (fp.add RNE .cse14 .cse15)) (not (fp.lt .cse16 v_prenex_6)) (not (fp.gt .cse16 (fp.mul RNE .cse17 .cse18))) (fp.geq v_prenex_7 (fp.sub RNE .cse14 .cse15)) (fp.geq .cse13 ((_ to_fp 11 53) RNE (/ 9.0 10.0)))))))))))) is different from false [2018-09-19 15:51:54,883 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse1 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse6 (fp.add RNE .cse2 .cse2))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse5) .cse6))) (and (not (fp.leq (fp.div RNE .cse1 .cse2) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse1)) (not (fp.lt .cse3 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse1 .cse4)) (fp.leq main_~dd~0 (fp.add RNE .cse1 .cse4)) (not (fp.gt .cse3 (fp.mul RNE .cse5 .cse6)))))))))) (and (exists ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse13 (fp.div RNE .cse8 v_prenex_7))) (let ((.cse11 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse12 (fp.add RNE .cse13 .cse13))) (let ((.cse10 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse11) .cse12)) (.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse7 (fp.div RNE .cse8 .cse13))) (and (fp.leq .cse7 ((_ to_fp 11 53) RNE 5.0)) (not (fp.leq v_prenex_7 .cse8)) (fp.leq v_prenex_7 (fp.add RNE .cse8 .cse9)) (not (fp.lt .cse10 v_prenex_6)) (not (fp.gt .cse10 (fp.mul RNE .cse11 .cse12))) (fp.geq v_prenex_7 (fp.sub RNE .cse8 .cse9)) (fp.geq .cse7 ((_ to_fp 11 53) RNE (/ 9.0 10.0))))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse15 (fp.div RNE .cse14 v_prenex_4))) (let ((.cse18 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse19 (fp.add RNE .cse15 .cse15))) (let ((.cse16 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse17 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse18) .cse19))) (and (not (fp.geq (fp.div RNE .cse14 .cse15) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse14 .cse16)) (not (fp.gt .cse17 (fp.mul RNE .cse18 .cse19))) (fp.leq v_prenex_4 (fp.add RNE .cse14 .cse16)) (not (fp.lt .cse17 v_prenex_3)) (not (fp.leq v_prenex_4 .cse14))))))))))) is different from false [2018-09-19 15:52:09,873 WARN L797 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 v_prenex_4))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.geq (fp.div RNE .cse0 .cse1) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse0 .cse2)) (not (fp.gt .cse3 (fp.mul RNE .cse4 .cse5))) (fp.leq v_prenex_4 (fp.add RNE .cse0 .cse2)) (not (fp.lt .cse3 v_prenex_3)) (not (fp.leq v_prenex_4 .cse0)))))))) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.div RNE .cse6 main_~dd~0))) (let ((.cse10 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse11 (fp.add RNE .cse7 .cse7))) (let ((.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse8 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse10) .cse11))) (and (not (fp.leq (fp.div RNE .cse6 .cse7) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse6)) (not (fp.lt .cse8 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse6 .cse9)) (fp.leq main_~dd~0 (fp.add RNE .cse6 .cse9)) (not (fp.gt .cse8 (fp.mul RNE .cse10 .cse11)))))))))) is different from false [2018-09-19 15:52:12,622 WARN L819 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 v_prenex_4))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse5 (fp.add RNE .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse3 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse4) .cse5))) (and (not (fp.geq (fp.div RNE .cse0 .cse1) ((_ to_fp 11 53) RNE (/ 9.0 10.0)))) (fp.geq v_prenex_4 (fp.sub RNE .cse0 .cse2)) (not (fp.gt .cse3 (fp.mul RNE .cse4 .cse5))) (fp.leq v_prenex_4 (fp.add RNE .cse0 .cse2)) (not (fp.lt .cse3 v_prenex_3)) (not (fp.leq v_prenex_4 .cse0)))))))) (exists ((SqrtR_~linf~0 (_ FloatingPoint 11 53)) (main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse7 (fp.div RNE .cse6 main_~dd~0))) (let ((.cse10 ((_ to_fp 11 53) RNE (/ 1.0 1000000.0))) (.cse11 (fp.add RNE .cse7 .cse7))) (let ((.cse9 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0))) (.cse8 (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) .cse10) .cse11))) (and (not (fp.leq (fp.div RNE .cse6 .cse7) ((_ to_fp 11 53) RNE 5.0))) (not (fp.leq main_~dd~0 .cse6)) (not (fp.lt .cse8 SqrtR_~linf~0)) (fp.geq main_~dd~0 (fp.sub RNE .cse6 .cse9)) (fp.leq main_~dd~0 (fp.add RNE .cse6 .cse9)) (not (fp.gt .cse8 (fp.mul RNE .cse10 .cse11)))))))))) is different from true [2018-09-19 15:52:12,633 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:52:12,634 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:52:12,682 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:52:12,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 15:52:12,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-19 15:52:12,683 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-19 15:52:12,684 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=21, Unknown=15, NotChecked=144, Total=210 [2018-09-19 15:52:12,684 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-09-19 15:52:13,402 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-19 15:52:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:52:23,256 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-09-19 15:52:23,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 15:52:23,258 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-09-19 15:52:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:52:23,264 INFO L225 Difference]: With dead ends: 64 [2018-09-19 15:52:23,264 INFO L226 Difference]: Without dead ends: 62 [2018-09-19 15:52:23,265 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=35, Invalid=28, Unknown=15, NotChecked=162, Total=240 [2018-09-19 15:52:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-19 15:52:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-09-19 15:52:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-19 15:52:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-09-19 15:52:23,290 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 22 [2018-09-19 15:52:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:52:23,292 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-09-19 15:52:23,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-19 15:52:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-09-19 15:52:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-19 15:52:23,294 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:52:23,294 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:52:23,295 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:52:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1812175119, now seen corresponding path program 1 times [2018-09-19 15:52:23,295 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:52:23,296 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 15:52:23,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:52:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:52:53,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:52:55,945 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse2 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE c_SqrtR_~xnp1~0 .cse4))) (.cse3 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (let ((.cse1 (fp.lt .cse2 (fp.neg .cse3))) (.cse0 (fp.gt .cse2 .cse3))) (or (and (or .cse0 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)) (and (not .cse1) (not .cse0) (= (_ bv0 32) c_SqrtR_~cond~0))))) (fp.leq |c_SqrtR_#in~Input| .cse4) (= (fp.div RNE (fp.mul RNE .cse4 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse4) .cse4))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from false [2018-09-19 15:52:58,032 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse2 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE c_SqrtR_~xnp1~0 .cse4))) (.cse3 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (let ((.cse1 (fp.lt .cse2 (fp.neg .cse3))) (.cse0 (fp.gt .cse2 .cse3))) (or (and (or .cse0 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)) (and (not .cse1) (not .cse0) (= (_ bv0 32) c_SqrtR_~cond~0))))) (fp.leq |c_SqrtR_#in~Input| .cse4) (= (fp.div RNE (fp.mul RNE .cse4 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse4) .cse4))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0))) is different from true [2018-09-19 15:53:00,271 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE c_SqrtR_~xnp1~0 .cse2))) (.cse1 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.leq |c_SqrtR_#in~Input| .cse2) (= (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) (not (fp.gt .cse0 .cse1)) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)))) is different from false [2018-09-19 15:53:02,352 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE c_SqrtR_~xnp1~0 .cse2))) (.cse1 (fp.mul RNE c_~_EPS~0 (fp.add RNE c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.leq |c_SqrtR_#in~Input| .cse2) (= (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) (not (fp.gt .cse0 .cse1)) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0)))) is different from true [2018-09-19 15:53:05,015 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0)))) (let ((.cse1 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse3 .cse0))) (.cse2 (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse3 .cse3)))) (and (fp.leq |c_SqrtR_#in~Input| .cse0) (not (fp.gt .cse1 .cse2)) (= |c_SqrtR_#res| (fp.div RNE .cse0 .cse3)) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.lt .cse1 (fp.neg .cse2))))))) is different from false [2018-09-19 15:53:07,981 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0)))) (let ((.cse1 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse3 .cse0))) (.cse2 (fp.mul RNE c_~_EPS~0 (fp.add RNE .cse3 .cse3)))) (and (fp.leq |c_SqrtR_#in~Input| .cse0) (not (fp.gt .cse1 .cse2)) (= |c_SqrtR_#res| (fp.div RNE .cse0 .cse3)) (= ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.lt .cse1 (fp.neg .cse2))))))) is different from true [2018-09-19 15:53:10,630 WARN L797 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse3 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE main_~dd~0 .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) main_~dd~0) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (let ((.cse0 (fp.mul RNE ((_ to_fp 11 53) RNE 2.0) (fp.sub RNE .cse3 .cse2))) (.cse1 (fp.mul RNE ((_ to_fp 11 53) RNE (/ 1.0 1000000.0)) (fp.add RNE .cse3 .cse3)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1)) (fp.leq main_~dd~0 .cse2) (fp.geq main_~dd~0 (fp.sub RNE .cse2 ((_ to_fp 11 53) RNE (/ 1.0 100000000.0)))) (= |c_main_#t~ret3| (fp.div RNE .cse2 .cse3))))))) is different from false [2018-09-19 15:53:11,479 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-09-19 15:53:11,681 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2018-09-19 15:53:11,682 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:810) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:732) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:338) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:298) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-09-19 15:53:11,686 INFO L168 Benchmark]: Toolchain (without parser) took 188517.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -627.7 MB). Peak memory consumption was 100.0 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:11,688 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:53:11,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.23 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:53:11,689 INFO L168 Benchmark]: Boogie Preprocessor took 49.15 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:53:11,690 INFO L168 Benchmark]: RCFGBuilder took 10703.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.8 MB). Peak memory consumption was 38.1 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:11,692 INFO L168 Benchmark]: TraceAbstraction took 177425.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 134.5 MB). Peak memory consumption was 134.5 MB. Max. memory is 7.1 GB. [2018-09-19 15:53:11,697 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.23 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 49.15 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 10703.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.8 MB). Peak memory consumption was 38.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 177425.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 134.5 MB). Peak memory consumption was 134.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...