./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer --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 044666208476da4ad4fcec9a18fadf3bde3ce58f ................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer --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 044666208476da4ad4fcec9a18fadf3bde3ce58f .................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-09 00:00:42,933 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:00:42,934 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:00:42,940 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:00:42,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:00:42,941 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:00:42,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:00:42,942 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:00:42,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:00:42,943 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:00:42,944 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:00:42,944 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:00:42,944 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:00:42,945 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:00:42,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:00:42,945 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:00:42,946 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:00:42,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:00:42,948 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:00:42,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:00:42,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:00:42,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:00:42,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:00:42,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:00:42,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:00:42,951 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:00:42,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:00:42,952 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:00:42,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:00:42,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:00:42,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:00:42,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:00:42,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:00:42,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:00:42,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:00:42,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:00:42,954 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 00:00:42,961 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:00:42,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:00:42,962 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:00:42,962 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:00:42,962 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:00:42,962 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:00:42,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:00:42,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:00:42,964 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:00:42,964 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:00:42,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:00:42,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:00:42,964 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:00:42,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:00:42,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:00:42,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:00:42,964 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:00:42,964 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:00:42,964 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:00:42,965 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:00:42,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:00:42,965 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer 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 -> 044666208476da4ad4fcec9a18fadf3bde3ce58f [2018-12-09 00:00:42,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:00:42,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:00:42,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:00:42,996 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:00:42,996 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:00:42,997 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval_true-unreach-call.c [2018-12-09 00:00:43,040 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data/128471bab/965273058eff43369facdc94d02835b0/FLAGad35dba3c [2018-12-09 00:00:43,475 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:00:43,476 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/sv-benchmarks/c/float-benchs/sqrt_Householder_interval_true-unreach-call.c [2018-12-09 00:00:43,480 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data/128471bab/965273058eff43369facdc94d02835b0/FLAGad35dba3c [2018-12-09 00:00:43,489 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data/128471bab/965273058eff43369facdc94d02835b0 [2018-12-09 00:00:43,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:00:43,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:00:43,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:00:43,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:00:43,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:00:43,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf82b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43, skipping insertion in model container [2018-12-09 00:00:43,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:00:43,510 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:00:43,600 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:00:43,603 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:00:43,614 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:00:43,622 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:00:43,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43 WrapperNode [2018-12-09 00:00:43,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:00:43,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:00:43,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:00:43,623 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:00:43,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:00:43,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:00:43,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:00:43,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:00:43,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... [2018-12-09 00:00:43,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:00:43,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:00:43,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:00:43,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:00:43,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/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-09 00:00:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:00:43,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:00:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-12-09 00:00:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-12-09 00:00:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:00:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:00:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:00:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:00:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 00:00:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 00:00:43,806 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:00:43,806 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 00:00:43,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:00:43 BoogieIcfgContainer [2018-12-09 00:00:43,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:00:43,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:00:43,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:00:43,808 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:00:43,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:00:43" (1/3) ... [2018-12-09 00:00:43,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605406d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:00:43, skipping insertion in model container [2018-12-09 00:00:43,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:43" (2/3) ... [2018-12-09 00:00:43,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605406d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:00:43, skipping insertion in model container [2018-12-09 00:00:43,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:00:43" (3/3) ... [2018-12-09 00:00:43,810 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval_true-unreach-call.c [2018-12-09 00:00:43,816 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:00:43,820 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:00:43,828 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:00:43,845 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:00:43,845 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:00:43,845 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:00:43,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:00:43,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:00:43,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:00:43,845 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:00:43,846 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:00:43,846 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:00:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-09 00:00:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:00:43,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:00:43,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:00:43,860 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:00:43,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:00:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1096265462, now seen corresponding path program 1 times [2018-12-09 00:00:43,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:00:43,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:00:43,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:00:43,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:00:43,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:00:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:00:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:00:43,939 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:00:43,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:00:43 BoogieIcfgContainer [2018-12-09 00:00:43,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:00:43,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:00:43,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:00:43,955 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:00:43,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:00:43" (3/4) ... [2018-12-09 00:00:43,958 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:00:43,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:00:43,958 INFO L168 Benchmark]: Toolchain (without parser) took 467.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:00:43,959 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:00:43,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.73 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:00:43,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.89 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:00:43,960 INFO L168 Benchmark]: Boogie Preprocessor took 48.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:00:43,960 INFO L168 Benchmark]: RCFGBuilder took 121.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:00:43,961 INFO L168 Benchmark]: TraceAbstraction took 148.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:00:43,961 INFO L168 Benchmark]: Witness Printer took 2.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:00:43,963 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 130.73 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 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 12.89 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 121.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 148.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.69 ms. Allocated memory is still 1.2 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 51, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L17] double _EPS = 1e-6; VAL [\old(_EPS)=3, _EPS=1/1000000] [L44] double d, r; [L46] d = __VERIFIER_nondet_double() [L49] CALL, EXPR SqrtR(d) VAL [\old(Input)=2, _EPS=1/1000000] [L21] double xn, xnp1, residu, lsup, linf; [L22] int i, cond; VAL [\old(Input)=2, _EPS=1/1000000, Input=2] [L23] COND TRUE Input <= 1.0 [L23] xn = 1.0 VAL [\old(Input)=2, _EPS=1/1000000, Input=2, xn=1] [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 [\old(Input)=2, _EPS=1/1000000, cond=0, i=0, Input=2, xn=1, xn=1] [L30] COND FALSE !(\read(cond)) VAL [\old(Input)=2, _EPS=1/1000000, cond=0, i=0, Input=2, xn=1, xn=1] [L39] return 1.0 / xnp1; VAL [\old(Input)=2, _EPS=1/1000000, cond=0, i=0, Input=2, xn=1, xn=1] [L49] RET, EXPR SqrtR(d) VAL [_EPS=1/1000000, d=2, SqrtR(d)=4] [L49] r = SqrtR(d) [L51] CALL __VERIFIER_assert(r >= 0.3 && r <= 5.) VAL [\old(cond)=0, _EPS=1/1000000] [L15] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L15] __VERIFIER_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. UNSAFE Result, 0.1s 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=27occurred 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, 19 NumberOfCodeBlocks, 19 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.23-635dfa2 [2018-12-09 00:00:45,329 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:00:45,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:00:45,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:00:45,336 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:00:45,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:00:45,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:00:45,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:00:45,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:00:45,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:00:45,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:00:45,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:00:45,340 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:00:45,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:00:45,341 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:00:45,342 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:00:45,342 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:00:45,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:00:45,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:00:45,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:00:45,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:00:45,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:00:45,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:00:45,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:00:45,347 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:00:45,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:00:45,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:00:45,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:00:45,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:00:45,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:00:45,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:00:45,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:00:45,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:00:45,350 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:00:45,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:00:45,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:00:45,351 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-09 00:00:45,358 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:00:45,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:00:45,359 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:00:45,359 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:00:45,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:00:45,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:00:45,359 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:00:45,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:00:45,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:00:45,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:00:45,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 00:00:45,361 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 00:00:45,362 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer 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 -> 044666208476da4ad4fcec9a18fadf3bde3ce58f [2018-12-09 00:00:45,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:00:45,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:00:45,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:00:45,393 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:00:45,393 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:00:45,394 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval_true-unreach-call.c [2018-12-09 00:00:45,433 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data/21bc12537/cad3d3a8748f4096ac45b799f23c27f9/FLAG87b7e2b8e [2018-12-09 00:00:45,758 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:00:45,758 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/sv-benchmarks/c/float-benchs/sqrt_Householder_interval_true-unreach-call.c [2018-12-09 00:00:45,761 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data/21bc12537/cad3d3a8748f4096ac45b799f23c27f9/FLAG87b7e2b8e [2018-12-09 00:00:46,158 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/data/21bc12537/cad3d3a8748f4096ac45b799f23c27f9 [2018-12-09 00:00:46,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:00:46,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:00:46,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:00:46,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:00:46,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:00:46,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b97ddff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46, skipping insertion in model container [2018-12-09 00:00:46,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:00:46,181 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:00:46,272 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:00:46,276 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:00:46,289 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:00:46,298 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:00:46,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46 WrapperNode [2018-12-09 00:00:46,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:00:46,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:00:46,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:00:46,299 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:00:46,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:00:46,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:00:46,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:00:46,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:00:46,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... [2018-12-09 00:00:46,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:00:46,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:00:46,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:00:46,332 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:00:46,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/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-09 00:00:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:00:46,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:00:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-12-09 00:00:46,399 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-12-09 00:00:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:00:46,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:00:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:00:46,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:00:46,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 00:00:46,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 00:00:53,782 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:00:53,782 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 00:00:53,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:00:53 BoogieIcfgContainer [2018-12-09 00:00:53,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:00:53,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:00:53,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:00:53,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:00:53,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:00:46" (1/3) ... [2018-12-09 00:00:53,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c6b437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:00:53, skipping insertion in model container [2018-12-09 00:00:53,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:00:46" (2/3) ... [2018-12-09 00:00:53,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c6b437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:00:53, skipping insertion in model container [2018-12-09 00:00:53,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:00:53" (3/3) ... [2018-12-09 00:00:53,788 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval_true-unreach-call.c [2018-12-09 00:00:53,796 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:00:53,801 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:00:53,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:00:53,827 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:00:53,827 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:00:53,828 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:00:53,828 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:00:53,828 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:00:53,828 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:00:53,828 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:00:53,828 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:00:53,828 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:00:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-09 00:00:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:00:53,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:00:53,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:00:53,844 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:00:53,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:00:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1096265462, now seen corresponding path program 1 times [2018-12-09 00:00:53,850 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:00:53,850 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/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-09 00:00:53,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:00:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:55,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:01,604 WARN L180 SmtUtils]: Spent 4.81 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-12-09 00:01:01,608 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-09 00:01:01,609 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:01:01,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:01:01,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:01:01,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:01:01,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:01:01,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:01:01,644 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2018-12-09 00:01:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:01:07,678 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-12-09 00:01:07,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:01:07,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 00:01:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:01:07,684 INFO L225 Difference]: With dead ends: 45 [2018-12-09 00:01:07,684 INFO L226 Difference]: Without dead ends: 22 [2018-12-09 00:01:07,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:01:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-09 00:01:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-09 00:01:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 00:01:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-09 00:01:07,708 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2018-12-09 00:01:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:01:07,709 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-09 00:01:07,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:01:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-09 00:01:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:01:07,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:01:07,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:01:07,710 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:01:07,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:07,710 INFO L82 PathProgramCache]: Analyzing trace with hash -395200884, now seen corresponding path program 1 times [2018-12-09 00:01:07,710 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:01:07,711 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/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-09 00:01:07,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:01:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:11,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:14,347 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xn~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from false [2018-12-09 00:01:18,176 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (let ((.cse5 (let ((.cse6 (fp.div roundNearestTiesToEven .cse0 |c_SqrtR_#in~Input|))) (fp.add roundNearestTiesToEven .cse6 .cse6)))) (let ((.cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse5)) (.cse4 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse5))) (let ((.cse2 (fp.gt .cse3 .cse4)) (.cse1 (fp.lt .cse3 (fp.neg .cse4)))) (or (and (not .cse1) (not .cse2) (= (_ bv0 32) c_SqrtR_~cond~0)) (and (or .cse2 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)))))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from false [2018-12-09 00:01:20,559 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (let ((.cse5 (let ((.cse6 (fp.div roundNearestTiesToEven .cse0 |c_SqrtR_#in~Input|))) (fp.add roundNearestTiesToEven .cse6 .cse6)))) (let ((.cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse5)) (.cse4 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse5))) (let ((.cse2 (fp.gt .cse3 .cse4)) (.cse1 (fp.lt .cse3 (fp.neg .cse4)))) (or (and (not .cse1) (not .cse2) (= (_ bv0 32) c_SqrtR_~cond~0)) (and (or .cse2 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)))))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2018-12-09 00:01:22,885 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (let ((.cse4 (fp.div roundNearestTiesToEven .cse2 |c_SqrtR_#in~Input|))) (fp.add roundNearestTiesToEven .cse4 .cse4)))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse3)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse3))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.leq |c_SqrtR_#in~Input| .cse2)) (not (fp.gt .cse0 .cse1)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))))) is different from false [2018-12-09 00:01:25,259 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (let ((.cse4 (fp.div roundNearestTiesToEven .cse2 |c_SqrtR_#in~Input|))) (fp.add roundNearestTiesToEven .cse4 .cse4)))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse3)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse3))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.leq |c_SqrtR_#in~Input| .cse2)) (not (fp.gt .cse0 .cse1)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))))) is different from true [2018-12-09 00:01:32,251 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 (let ((.cse5 (fp.div roundNearestTiesToEven .cse2 main_~d~0))) (fp.add roundNearestTiesToEven .cse5 .cse5)))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3) .cse4)) (.cse1 (fp.mul roundNearestTiesToEven .cse3 .cse4))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.leq main_~d~0 .cse2)) (not (fp.gt .cse0 .cse1)) (fp.leq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0))))))) is different from false [2018-12-09 00:01:34,539 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 (let ((.cse5 (fp.div roundNearestTiesToEven .cse2 main_~d~0))) (fp.add roundNearestTiesToEven .cse5 .cse5)))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3) .cse4)) (.cse1 (fp.mul roundNearestTiesToEven .cse3 .cse4))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.leq main_~d~0 .cse2)) (not (fp.gt .cse0 .cse1)) (fp.leq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0))))))) is different from true [2018-12-09 00:01:53,279 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-09 00:01:53,279 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:01:53,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:01:53,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:01:53,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:01:53,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:01:53,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=12, Unknown=7, NotChecked=36, Total=72 [2018-12-09 00:01:53,311 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 9 states. [2018-12-09 00:01:57,071 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xn~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= |c_SqrtR_#in~Input| c_SqrtR_~Input))) is different from false [2018-12-09 00:02:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:02:03,891 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-12-09 00:02:03,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:02:03,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-12-09 00:02:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:02:03,894 INFO L225 Difference]: With dead ends: 32 [2018-12-09 00:02:03,894 INFO L226 Difference]: Without dead ends: 23 [2018-12-09 00:02:03,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=19, Invalid=13, Unknown=8, NotChecked=50, Total=90 [2018-12-09 00:02:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-09 00:02:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-09 00:02:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 00:02:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-09 00:02:03,899 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-12-09 00:02:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:02:03,899 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-09 00:02:03,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:02:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-09 00:02:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:02:03,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:02:03,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:02:03,900 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:02:03,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:02:03,900 INFO L82 PathProgramCache]: Analyzing trace with hash -552102720, now seen corresponding path program 1 times [2018-12-09 00:02:03,901 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 00:02:03,901 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e066da6b-8530-4832-b4b0-836002a723ed/bin-2019/uautomizer/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-09 00:02:03,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:02:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:02:11,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:02:14,244 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (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_SqrtR_#in~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_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven c_SqrtR_~xnp1~0 .cse0))) (.cse4 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (let ((.cse2 (fp.gt .cse3 .cse4)) (.cse1 (fp.lt .cse3 (fp.neg .cse4)))) (or (and (not .cse1) (= (_ bv0 32) c_SqrtR_~cond~0) (not .cse2)) (and (or .cse2 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0))))) (fp.leq |c_SqrtR_#in~Input| .cse0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from false [2018-12-09 00:02:16,526 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (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_SqrtR_#in~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_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven c_SqrtR_~xnp1~0 .cse0))) (.cse4 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (let ((.cse2 (fp.gt .cse3 .cse4)) (.cse1 (fp.lt .cse3 (fp.neg .cse4)))) (or (and (not .cse1) (= (_ bv0 32) c_SqrtR_~cond~0) (not .cse2)) (and (or .cse2 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0))))) (fp.leq |c_SqrtR_#in~Input| .cse0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2018-12-09 00:02:18,704 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven c_SqrtR_~xnp1~0 .cse0))) (.cse2 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (and (= (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_SqrtR_#in~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_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) (fp.leq |c_SqrtR_#in~Input| .cse0) (not (fp.lt .cse1 (fp.neg .cse2))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (fp.gt .cse1 .cse2))))) is different from false [2018-12-09 00:02:20,768 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven c_SqrtR_~xnp1~0 .cse0))) (.cse2 (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0)))) (and (= (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_SqrtR_#in~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_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_SqrtR_~xnp1~0) (fp.leq |c_SqrtR_#in~Input| .cse0) (not (fp.lt .cse1 (fp.neg .cse2))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (fp.gt .cse1 .cse2))))) is different from true [2018-12-09 00:02:23,250 WARN L832 $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_SqrtR_#in~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_SqrtR_#in~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.lt .cse0 (fp.neg .cse1))) (fp.leq |c_SqrtR_#in~Input| .cse2) (= (fp.div roundNearestTiesToEven .cse2 .cse3) |c_SqrtR_#res|) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (fp.gt .cse0 .cse1)))))) is different from false [2018-12-09 00:02:25,434 WARN L854 $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_SqrtR_#in~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_SqrtR_#in~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.lt .cse0 (fp.neg .cse1))) (fp.leq |c_SqrtR_#in~Input| .cse2) (= (fp.div roundNearestTiesToEven .cse2 .cse3) |c_SqrtR_#res|) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (not (fp.gt .cse0 .cse1)))))) is different from true [2018-12-09 00:02:27,927 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (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 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) main_~d~0) .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 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (fp.geq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.gt .cse0 .cse1)) (fp.leq main_~d~0 .cse2) (fp.leq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (= |c_main_#t~ret2| (fp.div roundNearestTiesToEven .cse2 .cse3)) (not (fp.lt .cse0 (fp.neg .cse1)))))))) is different from false [2018-12-09 00:02:30,296 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (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 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) main_~d~0) .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 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (fp.geq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.gt .cse0 .cse1)) (fp.leq main_~d~0 .cse2) (fp.leq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (= |c_main_#t~ret2| (fp.div roundNearestTiesToEven .cse2 .cse3)) (not (fp.lt .cse0 (fp.neg .cse1)))))))) is different from true [2018-12-09 00:02:32,774 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (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 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) main_~d~0) .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 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (fp.geq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.gt .cse0 .cse1)) (fp.leq main_~d~0 .cse2) (fp.leq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (= c_main_~r~0 (fp.div roundNearestTiesToEven .cse2 .cse3)) (not (fp.lt .cse0 (fp.neg .cse1)))))))) is different from false [2018-12-09 00:02:35,136 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~d~0 (_ FloatingPoint 11 53))) (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 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) main_~d~0) .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 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (fp.geq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.gt .cse0 .cse1)) (fp.leq main_~d~0 .cse2) (fp.leq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (= c_main_~r~0 (fp.div roundNearestTiesToEven .cse2 .cse3)) (not (fp.lt .cse0 (fp.neg .cse1)))))))) is different from true [2018-12-09 00:02:55,377 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_5 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (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 v_prenex_5 .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) v_prenex_5) .cse2) .cse2))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 .cse4)) (.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse4 .cse2))) (.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse4 .cse4)))) (and (fp.leq v_prenex_5 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.gt .cse0 .cse1)) (fp.leq v_prenex_5 .cse2) (fp.geq v_prenex_5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.lt .cse0 (fp.neg .cse1))))))))) (and (exists ((main_~d~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven main_~d~0 .cse5) .cse5) (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) main_~d~0) .cse5) .cse5))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse7 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse6 .cse5))) (.cse8 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse6 .cse6)))) (and (fp.geq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse6) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.gt .cse7 .cse8)) (fp.leq main_~d~0 .cse5) (fp.leq main_~d~0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.lt .cse7 (fp.neg .cse8)))))))) .cse9) (and (exists ((v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse13 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_3 .cse12) .cse12) (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) v_prenex_3) .cse12) .cse12))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (let ((.cse10 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse13 .cse12))) (.cse11 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse13 .cse13)))) (and (not (fp.gt .cse10 .cse11)) (not (fp.lt .cse10 (fp.neg .cse11))) (fp.leq v_prenex_3 .cse12) (fp.geq v_prenex_3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.geq (fp.div roundNearestTiesToEven .cse12 .cse13) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.leq v_prenex_3 ((_ to_fp 11 53) roundNearestTiesToEven 20.0))))))) .cse9))) is different from false [2018-12-09 00:03:11,955 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 00:03:12,157 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2018-12-09 00:03:12,158 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:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java: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) ... 39 more [2018-12-09 00:03:12,164 INFO L168 Benchmark]: Toolchain (without parser) took 146003.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -63.6 MB). Peak memory consumption was 69.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:12,165 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:03:12,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.35 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:12,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.32 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:12,167 INFO L168 Benchmark]: Boogie Preprocessor took 18.45 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:03:12,167 INFO L168 Benchmark]: RCFGBuilder took 7450.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:12,168 INFO L168 Benchmark]: TraceAbstraction took 138380.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.9 MB). Peak memory consumption was 95.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:12,171 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.35 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.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 14.32 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.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 18.45 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 7450.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 138380.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.9 MB). Peak memory consumption was 95.9 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...