./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/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 2efbbd8e1ed6cd606263edae3254601484469bf9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/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 2efbbd8e1ed6cd606263edae3254601484469bf9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-aa41828 [2018-11-23 06:37:56,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:37:56,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:37:56,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:37:56,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:37:56,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:37:56,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:37:56,791 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:37:56,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:37:56,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:37:56,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:37:56,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:37:56,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:37:56,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:37:56,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:37:56,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:37:56,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:37:56,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:37:56,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:37:56,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:37:56,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:37:56,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:37:56,802 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:37:56,802 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:37:56,803 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:37:56,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:37:56,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:37:56,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:37:56,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:37:56,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:37:56,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:37:56,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:37:56,806 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:37:56,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:37:56,807 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:37:56,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:37:56,808 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 06:37:56,817 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:37:56,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:37:56,818 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:37:56,818 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:37:56,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:37:56,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:37:56,818 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:37:56,818 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:37:56,819 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:37:56,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:37:56,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:37:56,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:37:56,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:37:56,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:37:56,819 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:37:56,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:37:56,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:37:56,820 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:37:56,820 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:37:56,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:37:56,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:37:56,820 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:37:56,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:37:56,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:37:56,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:37:56,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:37:56,821 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:37:56,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:37:56,821 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:37:56,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:37:56,821 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_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-11-23 06:37:56,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:37:56,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:37:56,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:37:56,853 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:37:56,853 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:37:56,854 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 06:37:56,888 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data/ef37934b7/cf9edbcd659a460ebbbe0b428bfee435/FLAG1f844646f [2018-11-23 06:37:57,288 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:37:57,288 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 06:37:57,292 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data/ef37934b7/cf9edbcd659a460ebbbe0b428bfee435/FLAG1f844646f [2018-11-23 06:37:57,301 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data/ef37934b7/cf9edbcd659a460ebbbe0b428bfee435 [2018-11-23 06:37:57,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:37:57,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:37:57,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:37:57,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:37:57,307 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:37:57,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108971e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57, skipping insertion in model container [2018-11-23 06:37:57,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:37:57,333 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:37:57,448 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:37:57,453 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:37:57,468 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:37:57,478 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:37:57,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57 WrapperNode [2018-11-23 06:37:57,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:37:57,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:37:57,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:37:57,479 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:37:57,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:37:57,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:37:57,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:37:57,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:37:57,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... [2018-11-23 06:37:57,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:37:57,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:37:57,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:37:57,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:37:57,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/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-11-23 06:37:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:37:57,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:37:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:37:57,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:37:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:37:57,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:37:57,674 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:37:57,674 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:37:57,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:37:57 BoogieIcfgContainer [2018-11-23 06:37:57,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:37:57,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:37:57,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:37:57,677 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:37:57,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:37:57" (1/3) ... [2018-11-23 06:37:57,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5bee57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:37:57, skipping insertion in model container [2018-11-23 06:37:57,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:37:57" (2/3) ... [2018-11-23 06:37:57,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5bee57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:37:57, skipping insertion in model container [2018-11-23 06:37:57,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:37:57" (3/3) ... [2018-11-23 06:37:57,679 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 06:37:57,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:37:57,688 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:37:57,697 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:37:57,717 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:37:57,717 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:37:57,718 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:37:57,718 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:37:57,718 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:37:57,718 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:37:57,718 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:37:57,718 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:37:57,718 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:37:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 06:37:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:37:57,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:37:57,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:37:57,732 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:37:57,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:37:57,735 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-23 06:37:57,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:37:57,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:37:57,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:37:57,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:37:57,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:37:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:37:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:37:57,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:37:57,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:37:57,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:37:57,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:37:57,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:37:57,861 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-23 06:37:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:37:57,919 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-11-23 06:37:57,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:37:57,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 06:37:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:37:57,925 INFO L225 Difference]: With dead ends: 75 [2018-11-23 06:37:57,926 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 06:37:57,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:37:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 06:37:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2018-11-23 06:37:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 06:37:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-23 06:37:57,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-23 06:37:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:37:57,950 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 06:37:57,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:37:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-23 06:37:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:37:57,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:37:57,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:37:57,951 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:37:57,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:37:57,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1763341697, now seen corresponding path program 1 times [2018-11-23 06:37:57,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:37:57,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:37:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:37:57,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:37:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:37:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:37:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:37:57,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:37:57,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:37:57,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:37:57,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:37:57,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:37:57,982 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-23 06:37:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:37:58,012 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2018-11-23 06:37:58,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:37:58,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 06:37:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:37:58,013 INFO L225 Difference]: With dead ends: 50 [2018-11-23 06:37:58,013 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 06:37:58,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:37:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 06:37:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2018-11-23 06:37:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 06:37:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-23 06:37:58,018 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-23 06:37:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:37:58,018 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 06:37:58,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:37:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 06:37:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:37:58,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:37:58,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:37:58,019 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:37:58,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:37:58,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1747284348, now seen corresponding path program 1 times [2018-11-23 06:37:58,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:37:58,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:37:58,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:37:58,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:37:58,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:37:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:37:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:37:58,044 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~__return_125~0)|=2.0, |old(~__return_main~0)|=4, |old(~_EPS~0)|=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [?] ~__return_main~0 := 0;~_EPS~0 := 1.0E-6;~__return_125~0 := 0.0; VAL [|old(~__return_125~0)|=2.0, |old(~__return_main~0)|=4, |old(~_EPS~0)|=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume true; VAL [|old(~__return_125~0)|=2.0, |old(~__return_main~0)|=4, |old(~_EPS~0)|=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] RET #75#return; VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call #t~ret0 := main(); VAL [|old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] havoc ~main__d~0;havoc ~main__r~0;~main__d~0 := 1.0; VAL [main_~main__d~0=1.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0);havoc ~__tmp_1~0;~__tmp_1~0 := ~main__d~0;havoc ~SqrtR__Input~0;~SqrtR__Input~0 := ~__tmp_1~0;havoc ~SqrtR__xn~0;havoc ~SqrtR__xnp1~0;havoc ~SqrtR__residu~0;havoc ~SqrtR__lsup~0;havoc ~SqrtR__linf~0;havoc ~SqrtR__i~0;havoc ~SqrtR__cond~0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR__Input~0=1.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0);~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR__Input~0=1.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~SqrtR__xnp1~0 := ~SqrtR__xn~0;~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0));~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0));~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0);havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR__Input~0=1.0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0); VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR__Input~0=1.0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0);~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0;~SqrtR__i~0 := 0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !!(0 == ~SqrtR__cond~0);~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0);~main__r~0 := ~__return_125~0;havoc ~main____CPAchecker_TMP_0~0; VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0); VAL [main_~__tmp_1~0=1.0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~main____CPAchecker_TMP_0~0 := 0; VAL [main_~__tmp_1~0=1.0, main_~main____CPAchecker_TMP_0~0=0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] havoc ~__tmp_2~0;~__tmp_2~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [main_~__tmp_1~0=1.0, main_~__tmp_2~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main____CPAchecker_TMP_0~0=0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume 0 == ~__VERIFIER_assert__cond~0; VAL [main_~__tmp_1~0=1.0, main_~__tmp_2~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main____CPAchecker_TMP_0~0=0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !false; VAL [main_~__tmp_1~0=1.0, main_~__tmp_2~0=0, main_~__VERIFIER_assert__cond~0=0, main_~main____CPAchecker_TMP_0~0=0, main_~main__d~0=1.0, main_~main__r~0=6.0, main_~SqrtR____CPAchecker_TMP_0~0=0, main_~SqrtR__cond~0=0, main_~SqrtR__Input~0=1.0, main_~SqrtR__i~0=0, main_~SqrtR__xnp1~0=5.0, main_~SqrtR__xn~0=5.0, |old(~__return_125~0)|=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] ensures true; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16-L142] assume ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30-L136] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0); [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39-L130] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121-L129] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0); [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47-L117] assume !!(0 == ~SqrtR__cond~0); [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83-L116] assume !~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94-L103] assume 0 == ~__VERIFIER_assert__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] ensures true; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16-L142] assume ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0); [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30-L136] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0); [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39-L130] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121-L129] assume !~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0); [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47-L117] assume !!(0 == ~SqrtR__cond~0); [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83-L116] assume !~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94-L103] assume 0 == ~__VERIFIER_assert__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0)) [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0)) [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47] COND FALSE !(!(0 == ~SqrtR__cond~0)) [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0)) [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0)) [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47] COND FALSE !(!(0 == ~SqrtR__cond~0)) [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0)) [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0)) [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47] COND FALSE !(!(0 == ~SqrtR__cond~0)) [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=2.0, ~__return_main~0=4, ~_EPS~0=3.0] [L1] ~__return_main~0 := 0; [L6] ~_EPS~0 := 1.0E-6; [L9] ~__return_125~0 := 0.0; VAL [old(~__return_125~0)=2.0, old(~__return_main~0)=4, old(~_EPS~0)=3.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [?] CALL call #t~ret0 := main(); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000] [L12] havoc ~main__d~0; [L13] havoc ~main__r~0; [L14] ~main__d~0 := 1.0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~_EPS~0=1/1000000, ~main__d~0=1.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__d~0, 20.0) [L19] havoc ~__tmp_1~0; [L20] ~__tmp_1~0 := ~main__d~0; [L21] havoc ~SqrtR__Input~0; [L22] ~SqrtR__Input~0 := ~__tmp_1~0; [L23] havoc ~SqrtR__xn~0; [L24] havoc ~SqrtR__xnp1~0; [L25] havoc ~SqrtR__residu~0; [L26] havoc ~SqrtR__lsup~0; [L27] havoc ~SqrtR__linf~0; [L28] havoc ~SqrtR__i~0; [L29] havoc ~SqrtR__cond~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L30] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__Input~0, 1.0)) [L134] ~SqrtR__xn~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__Input~0); VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0] [L34] ~SqrtR__xnp1~0 := ~SqrtR__xn~0; [L35] ~SqrtR__residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L36] ~SqrtR__lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~SqrtR__xn~0, ~SqrtR__xnp1~0)); [L37] ~SqrtR__linf~0 := ~someUnaryDOUBLEoperation(~SqrtR__lsup~0); [L38] havoc ~SqrtR____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L39] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__lsup~0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L121] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~SqrtR__residu~0, ~SqrtR__linf~0)) [L127] ~SqrtR____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L44] ~SqrtR__cond~0 := ~SqrtR____CPAchecker_TMP_0~0; [L45] ~SqrtR__i~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=0.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L47] COND FALSE !(!(0 == ~SqrtR__cond~0)) [L80] ~__return_125~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, ~SqrtR__xnp1~0); [L81] ~main__r~0 := ~__return_125~0; [L82] havoc ~main____CPAchecker_TMP_0~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L83] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 1.0)) VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L109] ~main____CPAchecker_TMP_0~0 := 0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L90] havoc ~__tmp_2~0; [L91] ~__tmp_2~0 := ~main____CPAchecker_TMP_0~0; [L92] havoc ~__VERIFIER_assert__cond~0; [L93] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L94] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L96] assert false; VAL [old(~__return_125~0)=0.0, ~__return_125~0=6.0, ~__return_main~0=0, ~__tmp_1~0=1.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~_EPS~0=1/1000000, ~main____CPAchecker_TMP_0~0=0, ~main__d~0=1.0, ~main__r~0=6.0, ~SqrtR____CPAchecker_TMP_0~0=0, ~SqrtR__cond~0=0, ~SqrtR__Input~0=1.0, ~SqrtR__i~0=0, ~SqrtR__xnp1~0=5.0, ~SqrtR__xn~0=5.0] [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\old(__return_125)=2, \old(__return_main)=4, \old(_EPS)=3, __return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L83] COND FALSE !(main__r >= 1.0) VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L109] main____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L96] __VERIFIER_error() VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] ----- [2018-11-23 06:37:58,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:37:58 BoogieIcfgContainer [2018-11-23 06:37:58,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:37:58,088 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:37:58,088 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:37:58,088 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:37:58,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:37:57" (3/4) ... [2018-11-23 06:37:58,092 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:37:58,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:37:58,092 INFO L168 Benchmark]: Toolchain (without parser) took 789.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:37:58,094 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:37:58,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.24 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:37:58,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:37:58,095 INFO L168 Benchmark]: Boogie Preprocessor took 49.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -205.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:37:58,095 INFO L168 Benchmark]: RCFGBuilder took 134.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:37:58,096 INFO L168 Benchmark]: TraceAbstraction took 412.97 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: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:37:58,096 INFO L168 Benchmark]: Witness Printer took 3.75 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-11-23 06:37:58,099 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.24 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -205.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 134.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 412.97 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: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.75 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: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L1] int __return_main; [L6] double _EPS = 0.0000010; [L9] double __return_125; VAL [\old(__return_125)=2, \old(__return_main)=4, \old(_EPS)=3, __return_125=0, __return_main=0, _EPS=1/1000000] [L12] double main__d; [L13] double main__r; [L14] main__d = 1.0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, _EPS=1/1000000, main__d=1] [L16] COND TRUE main__d <= 20.0 [L19] double __tmp_1; [L20] __tmp_1 = main__d [L21] double SqrtR__Input; [L22] SqrtR__Input = __tmp_1 [L23] double SqrtR__xn; [L24] double SqrtR__xnp1; [L25] double SqrtR__residu; [L26] double SqrtR__lsup; [L27] double SqrtR__linf; [L28] int SqrtR__i; [L29] int SqrtR__cond; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L30] COND FALSE !(SqrtR__Input <= 1.0) [L134] SqrtR__xn = 1.0 / SqrtR__Input VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1] [L34] SqrtR__xnp1 = SqrtR__xn [L35] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L36] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L37] SqrtR__linf = -SqrtR__lsup [L38] int SqrtR____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L39] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L121] COND FALSE !(SqrtR__residu < SqrtR__linf) [L127] SqrtR____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L44] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L45] SqrtR__i = 0 VAL [\old(__return_125)=0, __return_125=0, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L47] COND FALSE !(!(SqrtR__cond == 0)) [L80] __return_125 = 1.0 / SqrtR__xnp1 [L81] main__r = __return_125 [L82] int main____CPAchecker_TMP_0; VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L83] COND FALSE !(main__r >= 1.0) VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L109] main____CPAchecker_TMP_0 = 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_0 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] [L96] __VERIFIER_error() VAL [\old(__return_125)=0, __return_125=6, __return_main=0, __tmp_1=1, __tmp_2=0, __VERIFIER_assert__cond=0, _EPS=1/1000000, main____CPAchecker_TMP_0=0, main__d=1, main__r=6, SqrtR____CPAchecker_TMP_0=0, SqrtR__cond=0, SqrtR__i=0, SqrtR__Input=1, SqrtR__xn=5, SqrtR__xnp1=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 79 SDslu, 148 SDs, 0 SdLazy, 27 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-aa41828 [2018-11-23 06:37:59,513 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:37:59,514 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:37:59,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:37:59,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:37:59,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:37:59,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:37:59,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:37:59,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:37:59,527 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:37:59,527 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:37:59,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:37:59,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:37:59,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:37:59,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:37:59,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:37:59,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:37:59,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:37:59,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:37:59,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:37:59,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:37:59,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:37:59,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:37:59,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:37:59,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:37:59,538 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:37:59,539 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:37:59,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:37:59,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:37:59,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:37:59,540 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:37:59,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:37:59,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:37:59,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:37:59,542 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:37:59,542 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:37:59,543 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 06:37:59,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:37:59,552 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:37:59,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:37:59,553 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:37:59,554 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:37:59,554 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:37:59,554 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:37:59,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:37:59,554 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:37:59,554 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:37:59,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:37:59,555 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:37:59,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:37:59,555 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:37:59,555 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 06:37:59,555 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 06:37:59,555 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:37:59,555 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:37:59,555 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:37:59,556 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:37:59,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:37:59,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:37:59,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:37:59,556 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:37:59,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:37:59,556 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:37:59,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:37:59,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:37:59,557 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 06:37:59,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:37:59,557 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 06:37:59,557 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 06:37:59,557 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_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/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 -> 2efbbd8e1ed6cd606263edae3254601484469bf9 [2018-11-23 06:37:59,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:37:59,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:37:59,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:37:59,598 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:37:59,598 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:37:59,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 06:37:59,640 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data/ec7aef2ea/449ff68cc95847b79dde311310ed5dd6/FLAGa3a9ce543 [2018-11-23 06:38:00,041 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:38:00,042 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/sv-benchmarks/c/float-benchs/sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 06:38:00,046 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data/ec7aef2ea/449ff68cc95847b79dde311310ed5dd6/FLAGa3a9ce543 [2018-11-23 06:38:00,055 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/data/ec7aef2ea/449ff68cc95847b79dde311310ed5dd6 [2018-11-23 06:38:00,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:38:00,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:38:00,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:38:00,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:38:00,060 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:38:00,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe1055b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00, skipping insertion in model container [2018-11-23 06:38:00,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:38:00,084 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:38:00,205 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:38:00,210 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:38:00,228 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:38:00,237 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:38:00,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00 WrapperNode [2018-11-23 06:38:00,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:38:00,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:38:00,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:38:00,239 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:38:00,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:38:00,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:38:00,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:38:00,253 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:38:00,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... [2018-11-23 06:38:00,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:38:00,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:38:00,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:38:00,273 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:38:00,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/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-11-23 06:38:00,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:38:00,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:38:00,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:38:00,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:38:00,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:38:00,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:38:08,711 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:38:08,711 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:38:08,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:08 BoogieIcfgContainer [2018-11-23 06:38:08,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:38:08,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:38:08,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:38:08,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:38:08,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:38:00" (1/3) ... [2018-11-23 06:38:08,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4688dfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:08, skipping insertion in model container [2018-11-23 06:38:08,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:38:00" (2/3) ... [2018-11-23 06:38:08,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4688dfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:38:08, skipping insertion in model container [2018-11-23 06:38:08,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:38:08" (3/3) ... [2018-11-23 06:38:08,717 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c.p+cfa-reducer.c [2018-11-23 06:38:08,722 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:38:08,727 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:38:08,739 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:38:08,760 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:38:08,761 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:38:08,761 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:38:08,761 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:38:08,761 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:38:08,761 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:38:08,762 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:38:08,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:38:08,762 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:38:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 06:38:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:38:08,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:08,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:08,780 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:38:08,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash 276824482, now seen corresponding path program 1 times [2018-11-23 06:38:08,786 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:38:08,786 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/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-11-23 06:38:08,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:10,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:10,732 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:38:10,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:10,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:38:10,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:38:10,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:38:10,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:38:10,773 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-23 06:38:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:16,165 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-23 06:38:16,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:38:16,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 06:38:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:16,172 INFO L225 Difference]: With dead ends: 70 [2018-11-23 06:38:16,172 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 06:38:16,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 06:38:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-11-23 06:38:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 06:38:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-23 06:38:16,195 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2018-11-23 06:38:16,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:16,196 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 06:38:16,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:38:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-23 06:38:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:38:16,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:16,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:16,197 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:38:16,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1420788200, now seen corresponding path program 1 times [2018-11-23 06:38:16,198 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:38:16,198 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/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-11-23 06:38:16,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:17,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:17,412 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:38:17,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:17,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:38:17,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:38:17,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:38:17,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:38:17,445 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-11-23 06:38:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:25,062 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-11-23 06:38:25,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:38:25,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 06:38:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:25,063 INFO L225 Difference]: With dead ends: 48 [2018-11-23 06:38:25,063 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 06:38:25,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 06:38:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 06:38:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 06:38:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-23 06:38:25,069 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2018-11-23 06:38:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:25,069 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 06:38:25,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:38:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 06:38:25,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 06:38:25,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:25,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:38:25,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:38:25,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:25,071 INFO L82 PathProgramCache]: Analyzing trace with hash -619377979, now seen corresponding path program 1 times [2018-11-23 06:38:25,071 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:38:25,071 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/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-11-23 06:38:25,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:26,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:26,309 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:38:26,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:26,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:38:26,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:38:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:38:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:26,330 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2018-11-23 06:38:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:43,291 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 06:38:43,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:38:43,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 06:38:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:43,293 INFO L225 Difference]: With dead ends: 55 [2018-11-23 06:38:43,293 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 06:38:43,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 06:38:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-23 06:38:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 06:38:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 06:38:43,297 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2018-11-23 06:38:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:43,298 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 06:38:43,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:38:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 06:38:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 06:38:43,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:43,298 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, 1, 1] [2018-11-23 06:38:43,299 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:38:43,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:43,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1492678358, now seen corresponding path program 1 times [2018-11-23 06:38:43,299 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:38:43,299 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 06:38:43,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:46,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:38:46,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:38:46,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:38:46,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:38:46,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:38:46,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:38:46,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:38:46,878 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2018-11-23 06:38:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:38:52,401 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-11-23 06:38:52,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:38:52,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 06:38:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:38:52,402 INFO L225 Difference]: With dead ends: 54 [2018-11-23 06:38:52,403 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 06:38:52,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:38:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 06:38:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2018-11-23 06:38:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 06:38:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-23 06:38:52,410 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2018-11-23 06:38:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:38:52,411 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-23 06:38:52,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:38:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-11-23 06:38:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 06:38:52,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:38:52,413 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, 1, 1] [2018-11-23 06:38:52,413 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:38:52,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:38:52,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1476621009, now seen corresponding path program 1 times [2018-11-23 06:38:52,414 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:38:52,414 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 06:38:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:38:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:38:55,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:38:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:38:55,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:38:58,341 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-11-23 06:39:02,563 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-11-23 06:39:05,089 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-11-23 06:39:07,504 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-11-23 06:39:09,949 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-11-23 06:39:12,387 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-11-23 06:39:14,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-11-23 06:39:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 06:39:14,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:39:14,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 06:39:14,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:39:14,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:39:14,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=42, Unknown=7, NotChecked=60, Total=132 [2018-11-23 06:39:14,908 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2018-11-23 06:39:17,363 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-11-23 06:39:19,835 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 06:39:22,395 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 06:39:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:51,758 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2018-11-23 06:39:52,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:39:52,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 06:39:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:52,082 INFO L225 Difference]: With dead ends: 101 [2018-11-23 06:39:52,082 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 06:39:52,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=10, NotChecked=140, Total=240 [2018-11-23 06:39:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 06:39:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2018-11-23 06:39:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 06:39:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-11-23 06:39:52,091 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 22 [2018-11-23 06:39:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:52,091 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-23 06:39:52,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:39:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 06:39:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 06:39:52,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:52,092 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:39:52,092 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:39:52,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1956324209, now seen corresponding path program 2 times [2018-11-23 06:39:52,093 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:39:52,093 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 06:39:52,096 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 06:39:57,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:39:57,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:39:58,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:40:00,208 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_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 06:40:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-23 06:40:00,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:40:02,610 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 c_main_~SqrtR__xnp1~0) .cse0)) is different from false [2018-11-23 06:40:06,047 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from false [2018-11-23 06:40:08,622 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) .cse0)) is different from true [2018-11-23 06:40:11,344 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-11-23 06:40:14,077 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-11-23 06:40:16,733 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-11-23 06:40:19,407 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-11-23 06:40:22,061 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from false [2018-11-23 06:40:24,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0)) is different from true [2018-11-23 06:40:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-11-23 06:40:24,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:40:24,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 06:40:24,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 06:40:24,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 06:40:24,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=43, Unknown=10, NotChecked=102, Total=182 [2018-11-23 06:40:24,845 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 14 states. [2018-11-23 06:40:27,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~main__d~0))) is different from true [2018-11-23 06:40:30,264 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse0) .cse0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 06:40:33,069 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.div roundNearestTiesToEven .cse0 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (fp.div roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse4 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0))) (let ((.cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse5))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse1) .cse1))))))) .cse5))) .cse0) (= .cse0 c_main_~SqrtR__xn~0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 06:40:35,577 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from false [2018-11-23 06:40:38,145 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 8.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse0) .cse0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse0) .cse0))))) .cse4) c_main_~SqrtR__xn~0) (fp.geq (fp.div roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) .cse4)) .cse0) (= .cse0 c_main_~SqrtR__Input~0))) is different from true [2018-11-23 06:41:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:41:23,303 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2018-11-23 06:41:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:41:23,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-23 06:41:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:41:23,639 INFO L225 Difference]: With dead ends: 110 [2018-11-23 06:41:23,639 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 06:41:23,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=40, Invalid=57, Unknown=15, NotChecked=230, Total=342 [2018-11-23 06:41:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 06:41:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2018-11-23 06:41:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 06:41:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-11-23 06:41:23,656 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 26 [2018-11-23 06:41:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:41:23,657 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-23 06:41:23,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 06:41:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2018-11-23 06:41:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 06:41:23,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:41:23,658 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:41:23,658 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:41:23,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:41:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1739969516, now seen corresponding path program 1 times [2018-11-23 06:41:23,658 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:41:23,659 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 06:41:23,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:41:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:41:29,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:41:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 06:41:29,806 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:41:29,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:41:29,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:41:29,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:41:29,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:41:29,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:41:29,874 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 7 states. [2018-11-23 06:41:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:41:49,043 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2018-11-23 06:41:49,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:41:49,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 06:41:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:41:49,045 INFO L225 Difference]: With dead ends: 83 [2018-11-23 06:41:49,045 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 06:41:49,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:41:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 06:41:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-23 06:41:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 06:41:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-11-23 06:41:49,057 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 26 [2018-11-23 06:41:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:41:49,057 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-23 06:41:49,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:41:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-23 06:41:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 06:41:49,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:41:49,059 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:41:49,059 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:41:49,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:41:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1580885751, now seen corresponding path program 1 times [2018-11-23 06:41:49,059 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:41:49,059 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 06:41:49,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:41:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:41:55,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:41:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 06:41:55,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:41:55,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:41:55,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:41:55,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:41:55,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:41:55,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:41:55,285 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2018-11-23 06:42:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:42:14,444 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 06:42:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:42:14,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-23 06:42:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:42:14,446 INFO L225 Difference]: With dead ends: 80 [2018-11-23 06:42:14,446 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 06:42:14,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:42:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 06:42:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-11-23 06:42:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 06:42:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-11-23 06:42:14,460 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 27 [2018-11-23 06:42:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:42:14,460 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-11-23 06:42:14,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:42:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 06:42:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 06:42:14,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:42:14,461 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:42:14,461 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:42:14,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:14,461 INFO L82 PathProgramCache]: Analyzing trace with hash 127977651, now seen corresponding path program 3 times [2018-11-23 06:42:14,461 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:42:14,461 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 06:42:14,464 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 06:42:20,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:42:20,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:42:20,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:42:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 06:42:20,657 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 06:42:20,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:42:20,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:42:20,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:42:20,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:42:20,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:42:20,724 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 4 states. [2018-11-23 06:42:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:42:28,324 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2018-11-23 06:42:28,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:42:28,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 06:42:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:42:28,326 INFO L225 Difference]: With dead ends: 74 [2018-11-23 06:42:28,326 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 06:42:28,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:42:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 06:42:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 06:42:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 06:42:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-23 06:42:28,335 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 30 [2018-11-23 06:42:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:42:28,336 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 06:42:28,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:42:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 06:42:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 06:42:28,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:42:28,337 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:42:28,337 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:42:28,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:42:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash 331588760, now seen corresponding path program 1 times [2018-11-23 06:42:28,337 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:42:28,337 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 06:42:28,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:42:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:42:33,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:42:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:42:34,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:42:36,267 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-11-23 06:42:38,352 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-11-23 06:42:40,769 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-11-23 06:42:43,183 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-11-23 06:42:45,611 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-11-23 06:42:48,011 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-11-23 06:42:50,433 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-11-23 06:42:52,855 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from true [2018-11-23 06:42:54,880 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) is different from false [2018-11-23 06:42:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-11-23 06:42:55,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:42:55,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 06:42:55,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 06:42:55,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 06:42:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=53, Unknown=9, NotChecked=90, Total=182 [2018-11-23 06:42:55,060 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2018-11-23 06:42:58,551 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= .cse2 c_main_~main__d~0))) is different from true [2018-11-23 06:43:01,004 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~main__d~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_main_~main__d~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2018-11-23 06:43:03,435 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~SqrtR__Input~0))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) c_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2018-11-23 06:43:05,523 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.add roundNearestTiesToEven c_main_~SqrtR__xn~0 c_main_~SqrtR__xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.div roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) c_main_~SqrtR__xn~0)) is different from true [2018-11-23 06:43:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:32,307 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-11-23 06:43:32,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:43:32,308 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 06:43:32,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:43:32,308 INFO L225 Difference]: With dead ends: 94 [2018-11-23 06:43:32,309 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 06:43:32,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=38, Invalid=57, Unknown=13, NotChecked=198, Total=306 [2018-11-23 06:43:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 06:43:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2018-11-23 06:43:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 06:43:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-23 06:43:32,326 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 33 [2018-11-23 06:43:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:43:32,326 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-23 06:43:32,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 06:43:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-23 06:43:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 06:43:32,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:43:32,327 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:32,327 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:43:32,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1475552478, now seen corresponding path program 1 times [2018-11-23 06:43:32,328 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:43:32,328 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 06:43:32,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:37,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:43:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:43:37,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:43:39,454 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 06:43:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:43:39,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:43:39,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 06:43:39,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:43:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:43:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:43:39,527 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 8 states. [2018-11-23 06:43:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:43:51,295 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2018-11-23 06:43:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:43:51,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-23 06:43:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:43:51,296 INFO L225 Difference]: With dead ends: 89 [2018-11-23 06:43:51,296 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 06:43:51,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:43:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 06:43:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2018-11-23 06:43:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 06:43:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 06:43:51,312 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2018-11-23 06:43:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:43:51,312 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 06:43:51,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:43:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 06:43:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 06:43:51,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:43:51,313 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:43:51,313 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:43:51,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:43:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1707439107, now seen corresponding path program 1 times [2018-11-23 06:43:51,314 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:43:51,314 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cef656fc-7a46-4448-80f0-05f5cd1b0d3a/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-23 06:43:51,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:43:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:43:59,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:44:09,030 WARN L180 SmtUtils]: Spent 3.53 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 06:44:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:44:09,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:44:11,455 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from false [2018-11-23 06:44:13,785 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__xn~0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) c_main_~SqrtR__xn~0) c_main_~SqrtR__xn~0))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 c_main_~SqrtR__xn~0)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) is different from true [2018-11-23 06:44:16,436 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2018-11-23 06:44:19,107 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2018-11-23 06:44:21,778 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from false [2018-11-23 06:44:24,434 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) is different from true [2018-11-23 06:44:27,085 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from false [2018-11-23 06:44:29,762 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) is different from true [2018-11-23 06:44:30,554 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 06:44:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2018-11-23 06:44:30,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:44:30,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 06:44:30,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 06:44:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 06:44:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=61, Unknown=9, NotChecked=76, Total=182 [2018-11-23 06:44:30,681 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 14 states. [2018-11-23 06:44:39,933 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (let ((.cse2 (fp.add roundNearestTiesToEven c_main_~main__d~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse3 .cse2))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) .cse2) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))))) (= .cse3 c_main_~main__d~0))) is different from true [2018-11-23 06:44:42,627 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~main__d~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~main__d~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~main__d~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= c_main_~main__d~0 (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) is different from true [2018-11-23 06:44:45,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse1 (fp.div roundNearestTiesToEven .cse2 c_main_~SqrtR__Input~0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 15.0) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_main_~SqrtR__Input~0 .cse1) .cse1) (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) c_main_~SqrtR__Input~0) .cse1) .cse1))))) ((_ to_fp 11 53) roundNearestTiesToEven 8.0)))) (fp.gt (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) (fp.sub roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven c_~_EPS~0 (fp.add roundNearestTiesToEven .cse0 .cse0))))) (= (fp.add roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) c_main_~SqrtR__Input~0) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2018-11-23 06:44:47,427 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 06:44:47,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:44:47,428 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:845) 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.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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) ... 43 more [2018-11-23 06:44:47,431 INFO L168 Benchmark]: Toolchain (without parser) took 407373.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 950.8 MB in the beginning and 1.0 GB in the end (delta: -61.1 MB). Peak memory consumption was 76.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:44:47,432 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:44:47,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.71 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 933.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:44:47,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.44 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:44:47,433 INFO L168 Benchmark]: Boogie Preprocessor took 19.78 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:44:47,433 INFO L168 Benchmark]: RCFGBuilder took 8438.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:44:47,434 INFO L168 Benchmark]: TraceAbstraction took 398718.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.1 MB). Peak memory consumption was 94.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:44:47,437 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.71 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 933.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.44 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.78 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8438.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 398718.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.1 MB). Peak memory consumption was 94.3 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...