./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 ............................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:25:40,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:25:40,881 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:25:40,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:25:40,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:25:40,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:25:40,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:25:40,914 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:25:40,915 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:25:40,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:25:40,917 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:25:40,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:25:40,919 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:25:40,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:25:40,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:25:40,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:25:40,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:25:40,926 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:25:40,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:25:40,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:25:40,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:25:40,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:25:40,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:25:40,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:25:40,935 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:25:40,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:25:40,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:25:40,938 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:25:40,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:25:40,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:25:40,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:25:40,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:25:40,942 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:25:40,942 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:25:40,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:25:40,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:25:40,945 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:25:40,961 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:25:40,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:25:40,963 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:25:40,963 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:25:40,963 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:25:40,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:25:40,963 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:25:40,964 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:25:40,964 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:25:40,964 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:25:40,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:25:40,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:25:40,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:25:40,965 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:25:40,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:25:40,966 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:25:40,967 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:25:40,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:25:40,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:25:40,967 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:25:40,967 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:25:40,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:25:40,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:25:40,969 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:25:40,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:25:40,969 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:25:40,969 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:25:40,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:25:40,970 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-12-31 03:25:41,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:25:41,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:25:41,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:25:41,032 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:25:41,033 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:25:41,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-12-31 03:25:41,106 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb793233/1cb8c525954c4e8889277e2a38733f3b/FLAG3d88df542 [2018-12-31 03:25:41,564 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:25:41,565 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-12-31 03:25:41,572 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb793233/1cb8c525954c4e8889277e2a38733f3b/FLAG3d88df542 [2018-12-31 03:25:41,913 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb793233/1cb8c525954c4e8889277e2a38733f3b [2018-12-31 03:25:41,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:25:41,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:25:41,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:25:41,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:25:41,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:25:41,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:25:41" (1/1) ... [2018-12-31 03:25:41,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e95935a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:41, skipping insertion in model container [2018-12-31 03:25:41,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:25:41" (1/1) ... [2018-12-31 03:25:41,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:25:41,962 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:25:42,225 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:25:42,232 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:25:42,258 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:25:42,277 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:25:42,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42 WrapperNode [2018-12-31 03:25:42,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:25:42,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:25:42,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:25:42,280 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:25:42,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (1/1) ... [2018-12-31 03:25:42,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (1/1) ... [2018-12-31 03:25:42,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:25:42,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:25:42,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:25:42,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:25:42,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (1/1) ... [2018-12-31 03:25:42,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (1/1) ... [2018-12-31 03:25:42,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (1/1) ... [2018-12-31 03:25:42,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (1/1) ... [2018-12-31 03:25:42,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (1/1) ... [2018-12-31 03:25:42,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (1/1) ... [2018-12-31 03:25:42,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (1/1) ... [2018-12-31 03:25:42,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:25:42,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:25:42,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:25:42,357 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:25:42,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (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-12-31 03:25:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:25:42,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:25:42,920 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:25:42,920 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-31 03:25:42,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:25:42 BoogieIcfgContainer [2018-12-31 03:25:42,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:25:42,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:25:42,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:25:42,925 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:25:42,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:25:41" (1/3) ... [2018-12-31 03:25:42,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bda21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:25:42, skipping insertion in model container [2018-12-31 03:25:42,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:42" (2/3) ... [2018-12-31 03:25:42,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bda21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:25:42, skipping insertion in model container [2018-12-31 03:25:42,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:25:42" (3/3) ... [2018-12-31 03:25:42,929 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-12-31 03:25:42,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:25:42,949 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:25:42,969 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:25:43,005 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:25:43,006 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:25:43,006 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:25:43,006 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:25:43,007 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:25:43,007 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:25:43,007 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:25:43,007 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:25:43,007 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:25:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-12-31 03:25:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:25:43,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:25:43,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:25:43,040 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:25:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:25:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2018-12-31 03:25:43,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:25:43,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:25:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:25:43,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:25:43,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:25:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:25:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:25:43,211 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:25:43,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:25:43 BoogieIcfgContainer [2018-12-31 03:25:43,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:25:43,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:25:43,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:25:43,249 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:25:43,252 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:25:42" (3/4) ... [2018-12-31 03:25:43,258 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:25:43,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:25:43,259 INFO L168 Benchmark]: Toolchain (without parser) took 1341.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:25:43,262 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:25:43,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.47 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:25:43,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.90 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:25:43,266 INFO L168 Benchmark]: Boogie Preprocessor took 29.41 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:25:43,268 INFO L168 Benchmark]: RCFGBuilder took 564.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:25:43,274 INFO L168 Benchmark]: TraceAbstraction took 326.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:25:43,275 INFO L168 Benchmark]: Witness Printer took 8.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:25:43,284 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.47 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.90 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.41 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 564.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 326.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Witness Printer took 8.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 15]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L17] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L44] double d, r; [L46] d = 1. VAL [_EPS=1/1000000] [L46] COND TRUE d <= 20. [L21] double xn, xnp1, residu, lsup, linf; [L22] int i, cond; VAL [_EPS=1/1000000] [L23] COND TRUE Input <= 1.0 [L23] xn = 1.0 VAL [_EPS=1/1000000] [L24] xnp1 = xn [L25] residu = 2.0*_EPS*(xn+xnp1) [L26] lsup = _EPS * (xn+xnp1) [L27] linf = -lsup [L28] cond = ((residu > lsup) || (residu < linf)) [L29] i = 0 VAL [_EPS=1/1000000] [L30] COND FALSE !(\read(cond)) VAL [_EPS=1/1000000] [L39] return 1.0 / xnp1; VAL [_EPS=1/1000000] [L48] r = SqrtR(d) [L15] COND TRUE !(cond) VAL [_EPS=1/1000000] [L15] __VERIFIER_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:25:45,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:25:45,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:25:45,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:25:45,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:25:45,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:25:45,825 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:25:45,827 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:25:45,829 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:25:45,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:25:45,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:25:45,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:25:45,832 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:25:45,833 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:25:45,834 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:25:45,835 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:25:45,836 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:25:45,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:25:45,840 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:25:45,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:25:45,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:25:45,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:25:45,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:25:45,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:25:45,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:25:45,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:25:45,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:25:45,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:25:45,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:25:45,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:25:45,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:25:45,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:25:45,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:25:45,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:25:45,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:25:45,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:25:45,857 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:25:45,873 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:25:45,873 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:25:45,874 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:25:45,875 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:25:45,875 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:25:45,875 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:25:45,875 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:25:45,875 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:25:45,876 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:25:45,876 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:25:45,876 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:25:45,876 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:25:45,876 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:25:45,877 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:25:45,877 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:25:45,877 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:25:45,877 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:25:45,877 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:25:45,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:25:45,878 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:25:45,878 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:25:45,878 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:25:45,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:25:45,878 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:25:45,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:25:45,879 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:25:45,879 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:25:45,879 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:25:45,879 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:25:45,879 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:25:45,880 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-12-31 03:25:45,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:25:45,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:25:45,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:25:45,937 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:25:45,937 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:25:45,938 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-12-31 03:25:46,007 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2eb8fbc0/4817ee3803384487b36fe89d08614d2f/FLAG5afea5afe [2018-12-31 03:25:46,479 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:25:46,480 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-12-31 03:25:46,487 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2eb8fbc0/4817ee3803384487b36fe89d08614d2f/FLAG5afea5afe [2018-12-31 03:25:46,826 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2eb8fbc0/4817ee3803384487b36fe89d08614d2f [2018-12-31 03:25:46,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:25:46,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:25:46,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:25:46,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:25:46,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:25:46,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:25:46" (1/1) ... [2018-12-31 03:25:46,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0630d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:46, skipping insertion in model container [2018-12-31 03:25:46,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:25:46" (1/1) ... [2018-12-31 03:25:46,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:25:46,881 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:25:47,135 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:25:47,144 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:25:47,172 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:25:47,190 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:25:47,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47 WrapperNode [2018-12-31 03:25:47,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:25:47,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:25:47,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:25:47,192 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:25:47,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (1/1) ... [2018-12-31 03:25:47,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (1/1) ... [2018-12-31 03:25:47,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:25:47,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:25:47,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:25:47,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:25:47,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (1/1) ... [2018-12-31 03:25:47,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (1/1) ... [2018-12-31 03:25:47,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (1/1) ... [2018-12-31 03:25:47,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (1/1) ... [2018-12-31 03:25:47,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (1/1) ... [2018-12-31 03:25:47,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (1/1) ... [2018-12-31 03:25:47,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (1/1) ... [2018-12-31 03:25:47,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:25:47,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:25:47,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:25:47,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:25:47,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (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-12-31 03:25:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:25:47,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:25:57,057 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:25:57,057 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-31 03:25:57,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:25:57 BoogieIcfgContainer [2018-12-31 03:25:57,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:25:57,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:25:57,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:25:57,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:25:57,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:25:46" (1/3) ... [2018-12-31 03:25:57,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c69d723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:25:57, skipping insertion in model container [2018-12-31 03:25:57,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:25:47" (2/3) ... [2018-12-31 03:25:57,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c69d723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:25:57, skipping insertion in model container [2018-12-31 03:25:57,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:25:57" (3/3) ... [2018-12-31 03:25:57,067 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-12-31 03:25:57,078 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:25:57,087 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:25:57,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:25:57,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:25:57,145 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:25:57,145 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:25:57,145 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:25:57,146 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:25:57,146 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:25:57,146 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:25:57,146 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:25:57,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:25:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-12-31 03:25:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:25:57,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:25:57,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:25:57,176 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:25:57,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:25:57,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2018-12-31 03:25:57,190 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:25:57,191 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-12-31 03:25:57,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:25:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:25:58,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:25:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:25:58,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:25:59,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:25:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:25:59,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:25:59,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:25:59,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:25:59,048 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2018-12-31 03:26:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:26:06,035 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-12-31 03:26:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:26:06,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 03:26:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:26:06,050 INFO L225 Difference]: With dead ends: 39 [2018-12-31 03:26:06,051 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 03:26:06,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:26:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 03:26:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-31 03:26:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-31 03:26:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-31 03:26:06,088 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2018-12-31 03:26:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:26:06,088 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-31 03:26:06,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:26:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-12-31 03:26:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:26:06,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:26:06,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:26:06,090 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:26:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:26:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash 68780179, now seen corresponding path program 1 times [2018-12-31 03:26:06,091 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:26:06,091 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-12-31 03:26:06,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:26:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:26:08,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:26:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:26:08,420 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:26:08,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:26:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:26:08,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:26:08,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:26:08,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:26:08,476 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 4 states. [2018-12-31 03:26:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:26:12,595 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-31 03:26:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:26:12,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-31 03:26:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:26:12,976 INFO L225 Difference]: With dead ends: 26 [2018-12-31 03:26:12,976 INFO L226 Difference]: Without dead ends: 16 [2018-12-31 03:26:12,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:26:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-31 03:26:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-31 03:26:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-31 03:26:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-31 03:26:12,983 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2018-12-31 03:26:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:26:12,984 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-31 03:26:12,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:26:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-31 03:26:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:26:12,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:26:12,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:26:12,985 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:26:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:26:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1301780435, now seen corresponding path program 1 times [2018-12-31 03:26:12,987 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:26:12,988 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) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:26:12,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:26:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:26:17,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:26:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:26:17,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:26:20,149 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:26:25,117 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-12-31 03:26:27,792 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-12-31 03:26:30,295 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:26:32,821 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:26:35,369 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:26:38,018 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:26:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-31 03:26:38,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:26:38,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-31 03:26:38,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 03:26:38,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 03:26:38,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=71, Unknown=7, NotChecked=76, Total=182 [2018-12-31 03:26:38,105 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 14 states. [2018-12-31 03:26:40,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 c_ULTIMATE.start_main_~d~0) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:26:43,261 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 c_ULTIMATE.start_main_~d~0) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:26:45,842 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= .cse0 c_ULTIMATE.start_SqrtR_~Input) (fp.geq .cse1 .cse0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:26:48,559 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1) (= .cse1 c_ULTIMATE.start_SqrtR_~Input) (= .cse1 c_ULTIMATE.start_SqrtR_~xn~0)))) is different from true [2018-12-31 03:26:50,983 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.geq .cse1 .cse0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:27:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:27:13,459 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-12-31 03:27:13,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 03:27:13,461 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-12-31 03:27:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:27:13,462 INFO L225 Difference]: With dead ends: 32 [2018-12-31 03:27:13,462 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 03:27:13,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=42, Invalid=88, Unknown=12, NotChecked=200, Total=342 [2018-12-31 03:27:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 03:27:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-31 03:27:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 03:27:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-31 03:27:13,473 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2018-12-31 03:27:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:27:13,473 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-31 03:27:13,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 03:27:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-31 03:27:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:27:13,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:27:13,474 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:27:13,475 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:27:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:27:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1648833135, now seen corresponding path program 2 times [2018-12-31 03:27:13,477 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:27:13,477 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-12-31 03:27:13,482 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-31 03:27:19,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 03:27:19,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 03:27:20,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:27:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:27:20,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:27:22,620 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_SqrtR_~xn~0))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1)))))) is different from false [2018-12-31 03:27:25,023 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_SqrtR_~xn~0))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1)))))) is different from true [2018-12-31 03:27:27,245 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse2 .cse3))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from false [2018-12-31 03:27:29,466 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse2 .cse3))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from true [2018-12-31 03:27:31,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse2 .cse3))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse2 .cse2)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1)))))) is different from false [2018-12-31 03:27:33,984 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse3) .cse3) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse3) .cse3))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse2 .cse3))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse2 .cse2)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1)))))) is different from true [2018-12-31 03:27:36,118 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-31 03:27:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-31 03:27:36,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:27:36,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-31 03:27:36,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 03:27:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 03:27:36,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=35, Unknown=6, NotChecked=42, Total=110 [2018-12-31 03:27:36,207 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 11 states. [2018-12-31 03:27:38,441 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse3 .cse0))) (.cse2 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse0 c_ULTIMATE.start_main_~d~0) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.gt .cse1 .cse2)))))) is different from true [2018-12-31 03:27:40,673 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse3 .cse2))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (not (fp.gt .cse0 .cse1)) (= .cse2 c_ULTIMATE.start_SqrtR_~Input) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from false [2018-12-31 03:27:42,901 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse3 .cse2))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (not (fp.gt .cse0 .cse1)) (= .cse2 c_ULTIMATE.start_SqrtR_~Input) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from true [2018-12-31 03:27:45,317 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_SqrtR_~xn~0))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (not (fp.gt .cse0 .cse1)) (= .cse2 c_ULTIMATE.start_SqrtR_~Input) (= .cse2 c_ULTIMATE.start_SqrtR_~xn~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (fp.lt .cse0 (fp.neg .cse1)))))) is different from false [2018-12-31 03:27:47,740 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_SqrtR_~xn~0))) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (not (fp.gt .cse0 .cse1)) (= .cse2 c_ULTIMATE.start_SqrtR_~Input) (= .cse2 c_ULTIMATE.start_SqrtR_~xn~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (fp.lt .cse0 (fp.neg .cse1)))))) is different from true [2018-12-31 03:28:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:28:09,025 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-31 03:28:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:28:09,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-12-31 03:28:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:28:09,402 INFO L225 Difference]: With dead ends: 30 [2018-12-31 03:28:09,403 INFO L226 Difference]: Without dead ends: 20 [2018-12-31 03:28:09,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=33, Invalid=36, Unknown=11, NotChecked=102, Total=182 [2018-12-31 03:28:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-31 03:28:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-31 03:28:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 03:28:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-31 03:28:09,412 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2018-12-31 03:28:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:28:09,412 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-31 03:28:09,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 03:28:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-31 03:28:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:28:09,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:28:09,413 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:28:09,413 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:28:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:28:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1471521565, now seen corresponding path program 1 times [2018-12-31 03:28:09,415 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:28:09,415 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 03:28:09,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 03:28:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:28:15,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:28:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 03:28:15,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:28:18,067 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-12-31 03:28:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 03:28:18,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:28:18,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-31 03:28:18,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:28:18,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:28:18,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:28:18,146 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 8 states. [2018-12-31 03:28:36,108 WARN L181 SmtUtils]: Spent 953.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 03:28:36,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:28:36,152 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-31 03:28:36,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 03:28:36,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-31 03:28:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:28:36,165 INFO L225 Difference]: With dead ends: 50 [2018-12-31 03:28:36,165 INFO L226 Difference]: Without dead ends: 40 [2018-12-31 03:28:36,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-31 03:28:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-31 03:28:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 20. [2018-12-31 03:28:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 03:28:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-31 03:28:36,177 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2018-12-31 03:28:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:28:36,177 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-31 03:28:36,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:28:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-31 03:28:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:28:36,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:28:36,178 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:28:36,179 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:28:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:28:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1048438369, now seen corresponding path program 1 times [2018-12-31 03:28:36,179 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:28:36,180 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:28:36,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:28:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:28:42,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:28:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 03:28:42,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:28:44,865 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_17))) is different from false [2018-12-31 03:28:46,979 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_17))) is different from true [2018-12-31 03:28:49,482 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse2 .cse2))) v_ULTIMATE.start_SqrtR_~linf~0_17))) is different from false [2018-12-31 03:28:51,971 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse2 .cse2))) v_ULTIMATE.start_SqrtR_~linf~0_17))) is different from true [2018-12-31 03:28:54,480 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~0))) (fp.add roundNearestTiesToEven .cse2 .cse2))) v_ULTIMATE.start_SqrtR_~linf~0_17))) is different from false [2018-12-31 03:28:56,971 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~0))) (fp.add roundNearestTiesToEven .cse2 .cse2))) v_ULTIMATE.start_SqrtR_~linf~0_17))) is different from true [2018-12-31 03:28:59,458 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse3 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse4))))) (fp.add roundNearestTiesToEven .cse3 .cse3))) v_ULTIMATE.start_SqrtR_~linf~0_17))) is different from false [2018-12-31 03:29:01,951 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse3 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse4))))) (fp.add roundNearestTiesToEven .cse3 .cse3))) v_ULTIMATE.start_SqrtR_~linf~0_17))) is different from true [2018-12-31 03:29:05,709 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse2 .cse2))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse3 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven .cse4 .cse4))))) (fp.add roundNearestTiesToEven .cse3 .cse3))) v_ULTIMATE.start_SqrtR_~linf~0_17))) is different from true [2018-12-31 03:29:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2018-12-31 03:29:05,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:29:05,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-31 03:29:05,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 03:29:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 03:29:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=53, Unknown=9, NotChecked=90, Total=182 [2018-12-31 03:29:05,799 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 14 states. [2018-12-31 03:29:10,106 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (or (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2)))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse3 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse4))))) (fp.add roundNearestTiesToEven .cse3 .cse3))) v_ULTIMATE.start_SqrtR_~linf~0_17))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse2 c_ULTIMATE.start_main_~d~0))) is different from true [2018-12-31 03:29:12,601 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~d~0 (fp.add roundNearestTiesToEven .cse0 .cse0)) (or (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~d~0))) (fp.add roundNearestTiesToEven .cse2 .cse2)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse3 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_main_~d~0))) (fp.add roundNearestTiesToEven .cse3 .cse3))) v_ULTIMATE.start_SqrtR_~linf~0_17))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2018-12-31 03:29:15,127 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse0)) (or (let ((.cse1 (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse2 .cse2)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse1) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse3 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse3 .cse3))) v_ULTIMATE.start_SqrtR_~linf~0_17))))) is different from true [2018-12-31 03:29:17,251 WARN L860 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_17 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_17))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse1 .cse1))) c_ULTIMATE.start_SqrtR_~xn~0)) is different from true [2018-12-31 03:29:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:29:30,037 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-12-31 03:29:30,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:29:30,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-12-31 03:29:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:29:30,176 INFO L225 Difference]: With dead ends: 35 [2018-12-31 03:29:30,176 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 03:29:30,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=38, Invalid=57, Unknown=13, NotChecked=198, Total=306 [2018-12-31 03:29:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 03:29:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 03:29:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 03:29:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-31 03:29:30,194 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2018-12-31 03:29:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:29:30,194 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-31 03:29:30,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 03:29:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-31 03:29:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 03:29:30,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:29:30,197 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:29:30,198 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:29:30,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:29:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1909803615, now seen corresponding path program 2 times [2018-12-31 03:29:30,199 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:29:30,199 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-31 03:29:30,208 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-31 03:29:38,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 03:29:38,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 03:29:39,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:29:41,675 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) (= c_ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from true [2018-12-31 03:29:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-12-31 03:29:41,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:29:44,367 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:29:46,787 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:29:49,498 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-12-31 03:29:52,229 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-12-31 03:29:55,286 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (let ((.cse2 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~Input))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse2) .cse2)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:29:58,322 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (let ((.cse2 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~Input))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse2) .cse2)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:30:01,386 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (let ((.cse2 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~d~0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse2) .cse2)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-12-31 03:30:04,453 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (let ((.cse2 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~d~0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse2) .cse2)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-12-31 03:30:07,580 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (let ((.cse3 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse1 .cse3))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse3) .cse2) .cse2))))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:30:10,671 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (let ((.cse3 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse1 .cse3))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse3) .cse2) .cse2))))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:30:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2018-12-31 03:30:10,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 03:30:10,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-12-31 03:30:10,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 03:30:10,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 03:30:10,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=72, Unknown=11, NotChecked=126, Total=240 [2018-12-31 03:30:10,804 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 16 states. [2018-12-31 03:30:13,925 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (let ((.cse3 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse1))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse1 .cse3))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse3) .cse2) .cse2))))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (= .cse1 c_ULTIMATE.start_main_~d~0)))) is different from true [2018-12-31 03:30:17,048 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~d~0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_main_~d~0) .cse2) .cse2)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= c_ULTIMATE.start_main_~d~0 (fp.add roundNearestTiesToEven .cse0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse1 .cse0)))) is different from true [2018-12-31 03:30:20,134 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (let ((.cse2 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~Input))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse2) .cse2)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (= c_ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse1 .cse1)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:30:23,237 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (let ((.cse2 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~Input))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse2) .cse2)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.geq .cse0 .cse1) (= c_ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse1 .cse1)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:30:25,852 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse1 .cse0) (= c_ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2018-12-31 03:30:28,821 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (= (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse1 .cse0) (= c_ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2018-12-31 03:30:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:30:55,946 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-12-31 03:30:55,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 03:30:55,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-12-31 03:30:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:30:55,949 INFO L225 Difference]: With dead ends: 41 [2018-12-31 03:30:55,950 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 03:30:55,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=52, Invalid=103, Unknown=17, NotChecked=290, Total=462 [2018-12-31 03:30:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 03:30:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2018-12-31 03:30:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 03:30:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-31 03:30:55,969 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2018-12-31 03:30:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:30:55,970 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-31 03:30:55,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 03:30:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-31 03:30:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:30:55,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:30:55,972 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:30:55,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:30:55,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:30:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash -873975393, now seen corresponding path program 3 times [2018-12-31 03:30:55,973 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:30:55,973 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-31 03:30:55,977 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-31 03:31:04,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-31 03:31:04,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 03:31:04,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:31:07,178 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven .cse0 c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) (= c_ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from true [2018-12-31 03:31:09,500 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~Input))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_ULTIMATE.start_SqrtR_~xn~0) (= c_ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse1 .cse1)))) is different from true [2018-12-31 03:31:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2018-12-31 03:31:09,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-31 03:31:12,141 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:31:14,532 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2018-12-31 03:31:17,239 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-12-31 03:31:19,965 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-12-31 03:31:23,249 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse5 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse6))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2018-12-31 03:31:25,042 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-31 03:31:25,244 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2018-12-31 03:31:25,245 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:155) 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:141) 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:851) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) 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.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) 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:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) 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:456) 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:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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) ... 40 more [2018-12-31 03:31:25,251 INFO L168 Benchmark]: Toolchain (without parser) took 338419.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 951.4 MB in the beginning and 821.0 MB in the end (delta: 130.4 MB). Peak memory consumption was 259.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:31:25,259 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:31:25,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.31 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:31:25,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.91 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:31:25,265 INFO L168 Benchmark]: Boogie Preprocessor took 64.40 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:31:25,266 INFO L168 Benchmark]: RCFGBuilder took 9744.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:31:25,267 INFO L168 Benchmark]: TraceAbstraction took 328190.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.0 MB in the end (delta: 275.8 MB). Peak memory consumption was 275.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:31:25,274 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.31 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.91 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.40 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 9744.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 328190.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.0 MB in the end (delta: 275.8 MB). Peak memory consumption was 275.8 MB. Max. memory is 11.5 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...