./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/arctan_Pade_true-unreach-call_true-termination.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_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/arctan_Pade_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/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 8df1e49a9eb646d8ac7821b53cc17b33c788acf9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/arctan_Pade_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/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 8df1e49a9eb646d8ac7821b53cc17b33c788acf9 ...................................................................................................................................................................................................................................................................................... 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 08:09:55,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:09:55,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:09:55,960 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:09:55,960 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:09:55,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:09:55,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:09:55,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:09:55,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:09:55,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:09:55,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:09:55,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:09:55,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:09:55,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:09:55,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:09:55,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:09:55,970 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:09:55,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:09:55,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:09:55,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:09:55,975 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:09:55,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:09:55,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:09:55,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:09:55,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:09:55,980 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:09:55,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:09:55,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:09:55,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:09:55,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:09:55,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:09:55,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:09:55,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:09:55,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:09:55,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:09:55,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:09:55,986 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 08:09:55,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:09:55,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:09:55,998 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:09:55,998 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:09:55,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:09:55,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:09:55,999 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:09:55,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:09:55,999 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:09:56,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:09:56,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:09:56,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:09:56,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:09:56,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:09:56,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:09:56,000 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:09:56,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:09:56,001 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:09:56,001 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:09:56,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:09:56,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:09:56,002 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:09:56,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:09:56,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:09:56,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:09:56,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:09:56,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:09:56,003 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:09:56,003 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:09:56,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:09:56,003 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_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/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 -> 8df1e49a9eb646d8ac7821b53cc17b33c788acf9 [2018-11-23 08:09:56,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:09:56,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:09:56,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:09:56,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:09:56,040 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:09:56,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/arctan_Pade_true-unreach-call_true-termination.c [2018-11-23 08:09:56,086 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data/b866199a7/26d9516249624227bb0b40e2226caef9/FLAG17c0a742f [2018-11-23 08:09:56,436 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:09:56,437 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/sv-benchmarks/c/float-benchs/arctan_Pade_true-unreach-call_true-termination.c [2018-11-23 08:09:56,442 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data/b866199a7/26d9516249624227bb0b40e2226caef9/FLAG17c0a742f [2018-11-23 08:09:56,456 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data/b866199a7/26d9516249624227bb0b40e2226caef9 [2018-11-23 08:09:56,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:09:56,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:09:56,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:09:56,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:09:56,463 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:09:56,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c6631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56, skipping insertion in model container [2018-11-23 08:09:56,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:09:56,489 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:09:56,619 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:09:56,623 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:09:56,640 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:09:56,650 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:09:56,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56 WrapperNode [2018-11-23 08:09:56,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:09:56,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:09:56,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:09:56,652 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:09:56,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:09:56,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:09:56,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:09:56,675 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:09:56,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... [2018-11-23 08:09:56,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:09:56,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:09:56,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:09:56,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:09:56,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/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 08:09:56,790 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN [2018-11-23 08:09:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN [2018-11-23 08:09:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:09:56,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:09:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:09:56,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:09:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_POS [2018-11-23 08:09:56,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_POS [2018-11-23 08:09:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:09:56,791 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:09:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 08:09:56,792 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 08:09:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure PADE_2_2 [2018-11-23 08:09:56,792 INFO L138 BoogieDeclarations]: Found implementation of procedure PADE_2_2 [2018-11-23 08:09:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_0_1 [2018-11-23 08:09:56,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_0_1 [2018-11-23 08:09:56,965 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:09:56,965 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 08:09:56,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:09:56 BoogieIcfgContainer [2018-11-23 08:09:56,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:09:56,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:09:56,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:09:56,970 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:09:56,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:09:56" (1/3) ... [2018-11-23 08:09:56,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3631b241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:09:56, skipping insertion in model container [2018-11-23 08:09:56,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:56" (2/3) ... [2018-11-23 08:09:56,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3631b241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:09:56, skipping insertion in model container [2018-11-23 08:09:56,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:09:56" (3/3) ... [2018-11-23 08:09:56,974 INFO L112 eAbstractionObserver]: Analyzing ICFG arctan_Pade_true-unreach-call_true-termination.c [2018-11-23 08:09:56,984 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:09:56,991 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:09:57,008 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:09:57,037 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:09:57,038 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:09:57,038 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:09:57,038 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:09:57,039 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:09:57,039 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:09:57,039 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:09:57,039 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:09:57,039 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:09:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 08:09:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 08:09:57,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:09:57,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:09:57,068 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:09:57,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:09:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1783113702, now seen corresponding path program 1 times [2018-11-23 08:09:57,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:09:57,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:09:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:09:57,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:09:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:09:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:09:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:09:57,186 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~Pi~0)|=8.0, ~Pi~0=8.0] [?] ~Pi~0 := 3.141592653589793; VAL [|old(~Pi~0)|=8.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] assume true; VAL [|old(~Pi~0)|=8.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] RET #53#return; VAL [~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] CALL call #t~ret7 := main(); VAL [~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet5;havoc #t~nondet5;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, ~someUnaryDOUBLEoperation(1.79E308)) && ~someBinaryDOUBLEComparisonOperation(~a~0, 1.79E308) then 1 else 0); VAL [main_~a~0=7.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] CALL call #t~ret6 := ARCTAN(~a~0); VAL [|ARCTAN_#in~x|=7.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] ~x := #in~x; VAL [ARCTAN_~x=7.0, |ARCTAN_#in~x|=7.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] assume ~someBinaryDOUBLEComparisonOperation(~x, ~convertINTToDOUBLE(0)); VAL [ARCTAN_~x=7.0, |ARCTAN_#in~x|=7.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] CALL call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] ~x := #in~x; VAL [ARCTAN_POS_~x=5.0, |ARCTAN_POS_#in~x|=5.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] assume ~someBinaryDOUBLEComparisonOperation(~x, 1.0); VAL [ARCTAN_POS_~x=5.0, |ARCTAN_POS_#in~x|=5.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] CALL call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] ~x := #in~x; VAL [ARCTAN_0_1_~x=3.0, |ARCTAN_0_1_#in~x|=3.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] CALL call #t~ret0 := PADE_2_2(~x); VAL [|PADE_2_2_#in~x|=3.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] ~x := #in~x;~x_2~0 := ~someBinaryArithmeticDOUBLEoperation(~x, ~x);#res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~x_2~0, ~someBinaryArithmeticDOUBLEoperation(3.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(9.0, 5.0), ~x_2~0)))); VAL [PADE_2_2_~x=3.0, |PADE_2_2_#in~x|=3.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] assume true; VAL [PADE_2_2_~x=3.0, |PADE_2_2_#in~x|=3.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] RET #65#return; VAL [ARCTAN_0_1_~x=3.0, |ARCTAN_0_1_#in~x|=3.0, |ARCTAN_0_1_#t~ret0|=4.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] #res := ~someBinaryArithmeticDOUBLEoperation(~x, #t~ret0);havoc #t~ret0; VAL [ARCTAN_0_1_~x=3.0, |ARCTAN_0_1_#in~x|=3.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] assume true; VAL [ARCTAN_0_1_~x=3.0, |ARCTAN_0_1_#in~x|=3.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] RET #57#return; VAL [ARCTAN_POS_~x=5.0, |ARCTAN_POS_#in~x|=5.0, |ARCTAN_POS_#t~ret1|=6.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~Pi~0, 2.0), #t~ret1);havoc #t~ret1; VAL [ARCTAN_POS_~x=5.0, |ARCTAN_POS_#in~x|=5.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] assume true; VAL [ARCTAN_POS_~x=5.0, |ARCTAN_POS_#in~x|=5.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] RET #49#return; VAL [ARCTAN_~x=7.0, |ARCTAN_#in~x|=7.0, |ARCTAN_#t~ret3|=9.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] #res := ~someUnaryDOUBLEoperation(#t~ret3);havoc #t~ret3; VAL [ARCTAN_~x=7.0, |ARCTAN_#in~x|=7.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] assume true; VAL [ARCTAN_~x=7.0, |ARCTAN_#in~x|=7.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] RET #61#return; VAL [main_~a~0=7.0, |main_#t~ret6|=2.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] ~r~0 := #t~ret6;havoc #t~ret6; VAL [main_~a~0=7.0, main_~r~0=2.0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(1.571)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 1.571) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~Pi~0=(/ 1570796326794896619.0 500000000000000000.0)] [?] CALL call ULTIMATE.init(); VAL [old(~Pi~0)=8.0, ~Pi~0=8.0] [L15] ~Pi~0 := 3.141592653589793; VAL [old(~Pi~0)=8.0, ~Pi~0=1570796326794896619/500000000000000000] [?] ensures true; VAL [old(~Pi~0)=8.0, ~Pi~0=1570796326794896619/500000000000000000] [?] RET call ULTIMATE.init(); VAL [~Pi~0=1570796326794896619/500000000000000000] [?] CALL call #t~ret7 := main(); VAL [~Pi~0=1570796326794896619/500000000000000000] [L42] havoc ~a~0; [L42] havoc ~r~0; [L44] ~a~0 := #t~nondet5; [L44] havoc #t~nondet5; [L45] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, ~someUnaryDOUBLEoperation(1.79E308)) && ~someBinaryDOUBLEComparisonOperation(~a~0, 1.79E308) then 1 else 0); VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] CALL call #t~ret6 := ARCTAN(~a~0); VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L34-L38] ~x := #in~x; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36-L37] assume ~someBinaryDOUBLEComparisonOperation(~x, ~convertINTToDOUBLE(0)); VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] CALL call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L28-L32] ~x := #in~x; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30-L31] assume ~someBinaryDOUBLEComparisonOperation(~x, 1.0); VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] CALL call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L23-L26] ~x := #in~x; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] CALL call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000] [L17-L21] ~x := #in~x; [L19] ~x_2~0 := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); [L20] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~x_2~0, ~someBinaryArithmeticDOUBLEoperation(3.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(9.0, 5.0), ~x_2~0)))); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L17-L21] ensures true; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] RET call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, #t~ret0=4.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] #res := ~someBinaryArithmeticDOUBLEoperation(~x, #t~ret0); [L25] havoc #t~ret0; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L23-L26] ensures true; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L30] RET call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [#in~x=5.0, #t~ret1=6.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~Pi~0, 2.0), #t~ret1); [L30] havoc #t~ret1; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L28-L32] ensures true; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L36] RET call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [#in~x=7.0, #t~ret3=9.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] #res := ~someUnaryDOUBLEoperation(#t~ret3); [L36] havoc #t~ret3; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L34-L38] ensures true; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L47] RET call #t~ret6 := ARCTAN(~a~0); VAL [#t~ret6=2.0, ~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] ~r~0 := #t~ret6; [L47] havoc #t~ret6; VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~r~0=2.0] [L49] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(1.571)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 1.571) then 1 else 0)); VAL [#in~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] assert false; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~Pi~0)=8.0, ~Pi~0=8.0] [L15] ~Pi~0 := 3.141592653589793; VAL [old(~Pi~0)=8.0, ~Pi~0=1570796326794896619/500000000000000000] [?] ensures true; VAL [old(~Pi~0)=8.0, ~Pi~0=1570796326794896619/500000000000000000] [?] RET call ULTIMATE.init(); VAL [~Pi~0=1570796326794896619/500000000000000000] [?] CALL call #t~ret7 := main(); VAL [~Pi~0=1570796326794896619/500000000000000000] [L42] havoc ~a~0; [L42] havoc ~r~0; [L44] ~a~0 := #t~nondet5; [L44] havoc #t~nondet5; [L45] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, ~someUnaryDOUBLEoperation(1.79E308)) && ~someBinaryDOUBLEComparisonOperation(~a~0, 1.79E308) then 1 else 0); VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] CALL call #t~ret6 := ARCTAN(~a~0); VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L34-L38] ~x := #in~x; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36-L37] assume ~someBinaryDOUBLEComparisonOperation(~x, ~convertINTToDOUBLE(0)); VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] CALL call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L28-L32] ~x := #in~x; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30-L31] assume ~someBinaryDOUBLEComparisonOperation(~x, 1.0); VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] CALL call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L23-L26] ~x := #in~x; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] CALL call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000] [L17-L21] ~x := #in~x; [L19] ~x_2~0 := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); [L20] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~x_2~0, ~someBinaryArithmeticDOUBLEoperation(3.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(9.0, 5.0), ~x_2~0)))); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L17-L21] ensures true; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] RET call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, #t~ret0=4.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] #res := ~someBinaryArithmeticDOUBLEoperation(~x, #t~ret0); [L25] havoc #t~ret0; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L23-L26] ensures true; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L30] RET call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [#in~x=5.0, #t~ret1=6.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~Pi~0, 2.0), #t~ret1); [L30] havoc #t~ret1; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L28-L32] ensures true; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L36] RET call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [#in~x=7.0, #t~ret3=9.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] #res := ~someUnaryDOUBLEoperation(#t~ret3); [L36] havoc #t~ret3; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L34-L38] ensures true; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L47] RET call #t~ret6 := ARCTAN(~a~0); VAL [#t~ret6=2.0, ~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] ~r~0 := #t~ret6; [L47] havoc #t~ret6; VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~r~0=2.0] [L49] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(1.571)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 1.571) then 1 else 0)); VAL [#in~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] assert false; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [?] CALL call ULTIMATE.init(); VAL [old(~Pi~0)=8.0, ~Pi~0=8.0] [L15] ~Pi~0 := 3.141592653589793; VAL [old(~Pi~0)=8.0, ~Pi~0=1570796326794896619/500000000000000000] [?] RET call ULTIMATE.init(); VAL [~Pi~0=1570796326794896619/500000000000000000] [?] CALL call #t~ret7 := main(); VAL [~Pi~0=1570796326794896619/500000000000000000] [L42] havoc ~a~0; [L42] havoc ~r~0; [L44] ~a~0 := #t~nondet5; [L44] havoc #t~nondet5; [L45] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, ~someUnaryDOUBLEoperation(1.79E308)) && ~someBinaryDOUBLEComparisonOperation(~a~0, 1.79E308) then 1 else 0); VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] CALL call #t~ret6 := ARCTAN(~a~0); VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L34-L38] ~x := #in~x; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] COND TRUE ~someBinaryDOUBLEComparisonOperation(~x, ~convertINTToDOUBLE(0)) VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] CALL call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L28-L32] ~x := #in~x; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] COND TRUE ~someBinaryDOUBLEComparisonOperation(~x, 1.0) VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] CALL call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L23-L26] ~x := #in~x; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] CALL call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000] [L17-L21] ~x := #in~x; [L19] ~x_2~0 := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); [L20] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~x_2~0, ~someBinaryArithmeticDOUBLEoperation(3.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(9.0, 5.0), ~x_2~0)))); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] RET call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, #t~ret0=4.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] #res := ~someBinaryArithmeticDOUBLEoperation(~x, #t~ret0); [L25] havoc #t~ret0; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L30] RET call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [#in~x=5.0, #t~ret1=6.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~Pi~0, 2.0), #t~ret1); [L30] havoc #t~ret1; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L36] RET call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [#in~x=7.0, #t~ret3=9.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] #res := ~someUnaryDOUBLEoperation(#t~ret3); [L36] havoc #t~ret3; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L47] RET call #t~ret6 := ARCTAN(~a~0); VAL [#t~ret6=2.0, ~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] ~r~0 := #t~ret6; [L47] havoc #t~ret6; VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~r~0=2.0] [L49] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(1.571)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 1.571) then 1 else 0)); VAL [#in~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] assert false; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~Pi~0)=8.0, ~Pi~0=8.0] [L15] ~Pi~0 := 3.141592653589793; VAL [old(~Pi~0)=8.0, ~Pi~0=1570796326794896619/500000000000000000] [?] RET call ULTIMATE.init(); VAL [~Pi~0=1570796326794896619/500000000000000000] [?] CALL call #t~ret7 := main(); VAL [~Pi~0=1570796326794896619/500000000000000000] [L42] havoc ~a~0; [L42] havoc ~r~0; [L44] ~a~0 := #t~nondet5; [L44] havoc #t~nondet5; [L45] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, ~someUnaryDOUBLEoperation(1.79E308)) && ~someBinaryDOUBLEComparisonOperation(~a~0, 1.79E308) then 1 else 0); VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] CALL call #t~ret6 := ARCTAN(~a~0); VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L34-L38] ~x := #in~x; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] COND TRUE ~someBinaryDOUBLEComparisonOperation(~x, ~convertINTToDOUBLE(0)) VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] CALL call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L28-L32] ~x := #in~x; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] COND TRUE ~someBinaryDOUBLEComparisonOperation(~x, 1.0) VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] CALL call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L23-L26] ~x := #in~x; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] CALL call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000] [L17-L21] ~x := #in~x; [L19] ~x_2~0 := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); [L20] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~x_2~0, ~someBinaryArithmeticDOUBLEoperation(3.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(9.0, 5.0), ~x_2~0)))); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] RET call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, #t~ret0=4.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] #res := ~someBinaryArithmeticDOUBLEoperation(~x, #t~ret0); [L25] havoc #t~ret0; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L30] RET call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [#in~x=5.0, #t~ret1=6.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~Pi~0, 2.0), #t~ret1); [L30] havoc #t~ret1; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L36] RET call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [#in~x=7.0, #t~ret3=9.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] #res := ~someUnaryDOUBLEoperation(#t~ret3); [L36] havoc #t~ret3; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L47] RET call #t~ret6 := ARCTAN(~a~0); VAL [#t~ret6=2.0, ~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] ~r~0 := #t~ret6; [L47] havoc #t~ret6; VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~r~0=2.0] [L49] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(1.571)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 1.571) then 1 else 0)); VAL [#in~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] assert false; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [?] CALL call ULTIMATE.init(); VAL [old(~Pi~0)=8.0, ~Pi~0=8.0] [L15] ~Pi~0 := 3.141592653589793; VAL [old(~Pi~0)=8.0, ~Pi~0=1570796326794896619/500000000000000000] [?] RET call ULTIMATE.init(); VAL [~Pi~0=1570796326794896619/500000000000000000] [?] CALL call #t~ret7 := main(); VAL [~Pi~0=1570796326794896619/500000000000000000] [L42] havoc ~a~0; [L42] havoc ~r~0; [L44] ~a~0 := #t~nondet5; [L44] havoc #t~nondet5; [L45] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, ~someUnaryDOUBLEoperation(1.79E308)) && ~someBinaryDOUBLEComparisonOperation(~a~0, 1.79E308) then 1 else 0); VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] CALL call #t~ret6 := ARCTAN(~a~0); VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L34-L38] ~x := #in~x; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] COND TRUE ~someBinaryDOUBLEComparisonOperation(~x, ~convertINTToDOUBLE(0)) VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] CALL call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L28-L32] ~x := #in~x; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] COND TRUE ~someBinaryDOUBLEComparisonOperation(~x, 1.0) VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] CALL call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L23-L26] ~x := #in~x; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] CALL call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000] [L17-L21] ~x := #in~x; [L19] ~x_2~0 := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); [L20] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~x_2~0, ~someBinaryArithmeticDOUBLEoperation(3.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(9.0, 5.0), ~x_2~0)))); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] RET call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, #t~ret0=4.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] #res := ~someBinaryArithmeticDOUBLEoperation(~x, #t~ret0); [L25] havoc #t~ret0; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L30] RET call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [#in~x=5.0, #t~ret1=6.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~Pi~0, 2.0), #t~ret1); [L30] havoc #t~ret1; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L36] RET call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [#in~x=7.0, #t~ret3=9.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] #res := ~someUnaryDOUBLEoperation(#t~ret3); [L36] havoc #t~ret3; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L47] RET call #t~ret6 := ARCTAN(~a~0); VAL [#t~ret6=2.0, ~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] ~r~0 := #t~ret6; [L47] havoc #t~ret6; VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~r~0=2.0] [L49] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(1.571)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 1.571) then 1 else 0)); VAL [#in~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] assert false; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~Pi~0)=8.0, ~Pi~0=8.0] [L15] ~Pi~0 := 3.141592653589793; VAL [old(~Pi~0)=8.0, ~Pi~0=1570796326794896619/500000000000000000] [?] RET call ULTIMATE.init(); VAL [~Pi~0=1570796326794896619/500000000000000000] [?] CALL call #t~ret7 := main(); VAL [~Pi~0=1570796326794896619/500000000000000000] [L42] havoc ~a~0; [L42] havoc ~r~0; [L44] ~a~0 := #t~nondet5; [L44] havoc #t~nondet5; [L45] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, ~someUnaryDOUBLEoperation(1.79E308)) && ~someBinaryDOUBLEComparisonOperation(~a~0, 1.79E308) then 1 else 0); VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] CALL call #t~ret6 := ARCTAN(~a~0); VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L34-L38] ~x := #in~x; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] COND TRUE ~someBinaryDOUBLEComparisonOperation(~x, ~convertINTToDOUBLE(0)) VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] CALL call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L28-L32] ~x := #in~x; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] COND TRUE ~someBinaryDOUBLEComparisonOperation(~x, 1.0) VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] CALL call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [~Pi~0=1570796326794896619/500000000000000000] [L23-L26] ~x := #in~x; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] CALL call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000] [L17-L21] ~x := #in~x; [L19] ~x_2~0 := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); [L20] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~someBinaryArithmeticDOUBLEoperation(~x_2~0, ~someBinaryArithmeticDOUBLEoperation(3.0, ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(9.0, 5.0), ~x_2~0)))); VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] RET call #t~ret0 := PADE_2_2(~x); VAL [#in~x=3.0, #t~ret0=4.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L25] #res := ~someBinaryArithmeticDOUBLEoperation(~x, #t~ret0); [L25] havoc #t~ret0; VAL [#in~x=3.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=3.0] [L30] RET call #t~ret1 := ARCTAN_0_1(~someBinaryArithmeticDOUBLEoperation(1.0, ~x)); VAL [#in~x=5.0, #t~ret1=6.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L30] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~Pi~0, 2.0), #t~ret1); [L30] havoc #t~ret1; VAL [#in~x=5.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=5.0] [L36] RET call #t~ret3 := ARCTAN_POS(~someUnaryDOUBLEoperation(~x)); VAL [#in~x=7.0, #t~ret3=9.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L36] #res := ~someUnaryDOUBLEoperation(#t~ret3); [L36] havoc #t~ret3; VAL [#in~x=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~x=7.0] [L47] RET call #t~ret6 := ARCTAN(~a~0); VAL [#t~ret6=2.0, ~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000] [L47] ~r~0 := #t~ret6; [L47] havoc #t~ret6; VAL [~a~0=7.0, ~Pi~0=1570796326794896619/500000000000000000, ~r~0=2.0] [L49] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(1.571)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 1.571) then 1 else 0)); VAL [#in~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L12] assert false; VAL [#in~cond=0, ~cond=0, ~Pi~0=1570796326794896619/500000000000000000] [L15] const double Pi=3.141592653589793238; VAL [\old(Pi)=8, Pi=1570796326794896619/500000000000000000] [L42] double a, r; [L44] a = __VERIFIER_nondet_double() [L47] CALL, EXPR ARCTAN(a) VAL [\old(x)=7, Pi=1570796326794896619/500000000000000000] [L36] COND TRUE x < 0 VAL [\old(x)=7, Pi=1570796326794896619/500000000000000000, x=7] [L36] CALL, EXPR ARCTAN_POS(-x) VAL [Pi=1570796326794896619/500000000000000000] [L30] COND TRUE x > 1. VAL [\old(x)=5, Pi=1570796326794896619/500000000000000000, x=5] [L30] CALL, EXPR ARCTAN_0_1(1. / x) VAL [Pi=1570796326794896619/500000000000000000] [L25] CALL, EXPR PADE_2_2(x) VAL [\old(x)=3, Pi=1570796326794896619/500000000000000000] [L19] double x_2 = x*x; [L20] return 1. - x_2 / (3. + 9./5.*x_2); VAL [\old(x)=3, Pi=1570796326794896619/500000000000000000, x=3] [L25] RET, EXPR PADE_2_2(x) VAL [\old(x)=3, PADE_2_2(x)=4, Pi=1570796326794896619/500000000000000000, x=3] [L25] return x*PADE_2_2(x); [L30] RET, EXPR ARCTAN_0_1(1. / x) VAL [\old(x)=5, ARCTAN_0_1(1. / x)=6, Pi=1570796326794896619/500000000000000000, x=5] [L30] return Pi / 2. - ARCTAN_0_1(1. / x); [L36] RET, EXPR ARCTAN_POS(-x) VAL [\old(x)=7, ARCTAN_POS(-x)=9, Pi=1570796326794896619/500000000000000000, x=7] [L36] return -ARCTAN_POS(-x); [L47] RET, EXPR ARCTAN(a) VAL [a=7, ARCTAN(a)=2, Pi=1570796326794896619/500000000000000000] [L47] r = ARCTAN(a) [L49] CALL __VERIFIER_assert(r >= -1.571 && r <= 1.571) VAL [\old(cond)=0, Pi=1570796326794896619/500000000000000000] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, Pi=1570796326794896619/500000000000000000] [L12] __VERIFIER_error() VAL [\old(cond)=0, cond=0, Pi=1570796326794896619/500000000000000000] ----- [2018-11-23 08:09:57,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:09:57 BoogieIcfgContainer [2018-11-23 08:09:57,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:09:57,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:09:57,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:09:57,236 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:09:57,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:09:56" (3/4) ... [2018-11-23 08:09:57,240 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 08:09:57,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:09:57,241 INFO L168 Benchmark]: Toolchain (without parser) took 781.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 938.5 kB. Max. memory is 11.5 GB. [2018-11-23 08:09:57,242 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 08:09:57,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.32 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:09:57,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:09:57,243 INFO L168 Benchmark]: Boogie Preprocessor took 22.05 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:09:57,244 INFO L168 Benchmark]: RCFGBuilder took 269.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 08:09:57,244 INFO L168 Benchmark]: TraceAbstraction took 268.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-23 08:09:57,245 INFO L168 Benchmark]: Witness Printer took 4.58 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 08:09:57,247 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 190.32 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.05 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 269.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 268.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.58 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: 12]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 30, overapproximation of someUnaryDOUBLEoperation at line 36. Possible FailurePath: [L15] const double Pi=3.141592653589793238; VAL [\old(Pi)=8, Pi=1570796326794896619/500000000000000000] [L42] double a, r; [L44] a = __VERIFIER_nondet_double() [L47] CALL, EXPR ARCTAN(a) VAL [\old(x)=7, Pi=1570796326794896619/500000000000000000] [L36] COND TRUE x < 0 VAL [\old(x)=7, Pi=1570796326794896619/500000000000000000, x=7] [L36] CALL, EXPR ARCTAN_POS(-x) VAL [Pi=1570796326794896619/500000000000000000] [L30] COND TRUE x > 1. VAL [\old(x)=5, Pi=1570796326794896619/500000000000000000, x=5] [L30] CALL, EXPR ARCTAN_0_1(1. / x) VAL [Pi=1570796326794896619/500000000000000000] [L25] CALL, EXPR PADE_2_2(x) VAL [\old(x)=3, Pi=1570796326794896619/500000000000000000] [L19] double x_2 = x*x; [L20] return 1. - x_2 / (3. + 9./5.*x_2); VAL [\old(x)=3, Pi=1570796326794896619/500000000000000000, x=3] [L25] RET, EXPR PADE_2_2(x) VAL [\old(x)=3, PADE_2_2(x)=4, Pi=1570796326794896619/500000000000000000, x=3] [L25] return x*PADE_2_2(x); [L30] RET, EXPR ARCTAN_0_1(1. / x) VAL [\old(x)=5, ARCTAN_0_1(1. / x)=6, Pi=1570796326794896619/500000000000000000, x=5] [L30] return Pi / 2. - ARCTAN_0_1(1. / x); [L36] RET, EXPR ARCTAN_POS(-x) VAL [\old(x)=7, ARCTAN_POS(-x)=9, Pi=1570796326794896619/500000000000000000, x=7] [L36] return -ARCTAN_POS(-x); [L47] RET, EXPR ARCTAN(a) VAL [a=7, ARCTAN(a)=2, Pi=1570796326794896619/500000000000000000] [L47] r = ARCTAN(a) [L49] CALL __VERIFIER_assert(r >= -1.571 && r <= 1.571) VAL [\old(cond)=0, Pi=1570796326794896619/500000000000000000] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, Pi=1570796326794896619/500000000000000000] [L12] __VERIFIER_error() VAL [\old(cond)=0, cond=0, Pi=1570796326794896619/500000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 44 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 08:09:58,934 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:09:58,935 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:09:58,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:09:58,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:09:58,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:09:58,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:09:58,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:09:58,951 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:09:58,952 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:09:58,953 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:09:58,953 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:09:58,954 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:09:58,954 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:09:58,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:09:58,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:09:58,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:09:58,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:09:58,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:09:58,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:09:58,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:09:58,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:09:58,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:09:58,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:09:58,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:09:58,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:09:58,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:09:58,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:09:58,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:09:58,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:09:58,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:09:58,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:09:58,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:09:58,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:09:58,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:09:58,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:09:58,976 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 08:09:58,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:09:58,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:09:58,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:09:58,990 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:09:58,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:09:58,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:09:58,991 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:09:58,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:09:58,991 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:09:58,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:09:58,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:09:58,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:09:58,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:09:58,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:09:58,994 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 08:09:58,994 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 08:09:58,994 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:09:58,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:09:58,995 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:09:58,995 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:09:58,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:09:58,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:09:58,995 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:09:58,996 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:09:58,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:09:58,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:09:58,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:09:58,996 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:09:58,997 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 08:09:58,997 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:09:58,997 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 08:09:58,997 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 08:09:58,997 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_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/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 -> 8df1e49a9eb646d8ac7821b53cc17b33c788acf9 [2018-11-23 08:09:59,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:09:59,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:09:59,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:09:59,050 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:09:59,050 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:09:59,051 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/arctan_Pade_true-unreach-call_true-termination.c [2018-11-23 08:09:59,107 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data/c42182537/c5bfa27609344c7494e27bc093c436a8/FLAG20f95bdd3 [2018-11-23 08:09:59,453 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:09:59,453 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/sv-benchmarks/c/float-benchs/arctan_Pade_true-unreach-call_true-termination.c [2018-11-23 08:09:59,458 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data/c42182537/c5bfa27609344c7494e27bc093c436a8/FLAG20f95bdd3 [2018-11-23 08:09:59,468 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/bin-2019/uautomizer/data/c42182537/c5bfa27609344c7494e27bc093c436a8 [2018-11-23 08:09:59,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:09:59,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:09:59,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:09:59,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:09:59,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:09:59,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619db95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59, skipping insertion in model container [2018-11-23 08:09:59,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:09:59,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:09:59,654 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:09:59,659 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:09:59,675 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:09:59,688 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:09:59,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59 WrapperNode [2018-11-23 08:09:59,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:09:59,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:09:59,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:09:59,689 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:09:59,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:09:59,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:09:59,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:09:59,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:09:59,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... [2018-11-23 08:09:59,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:09:59,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:09:59,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:09:59,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:09:59,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/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 08:09:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN [2018-11-23 08:09:59,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN [2018-11-23 08:09:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:09:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:09:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:09:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:09:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_POS [2018-11-23 08:09:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_POS [2018-11-23 08:09:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:09:59,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:09:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 08:09:59,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 08:09:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure PADE_2_2 [2018-11-23 08:09:59,836 INFO L138 BoogieDeclarations]: Found implementation of procedure PADE_2_2 [2018-11-23 08:09:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_0_1 [2018-11-23 08:09:59,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_0_1 [2018-11-23 08:10:03,603 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:10:03,603 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 08:10:03,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:10:03 BoogieIcfgContainer [2018-11-23 08:10:03,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:10:03,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:10:03,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:10:03,606 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:10:03,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:09:59" (1/3) ... [2018-11-23 08:10:03,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f7a1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:10:03, skipping insertion in model container [2018-11-23 08:10:03,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:09:59" (2/3) ... [2018-11-23 08:10:03,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f7a1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:10:03, skipping insertion in model container [2018-11-23 08:10:03,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:10:03" (3/3) ... [2018-11-23 08:10:03,610 INFO L112 eAbstractionObserver]: Analyzing ICFG arctan_Pade_true-unreach-call_true-termination.c [2018-11-23 08:10:03,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:10:03,622 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:10:03,634 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:10:03,656 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:10:03,656 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:10:03,656 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:10:03,657 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:10:03,657 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:10:03,657 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:10:03,657 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:10:03,657 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:10:03,657 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:10:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 08:10:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 08:10:03,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:10:03,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:10:03,678 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:10:03,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:10:03,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1783113702, now seen corresponding path program 1 times [2018-11-23 08:10:03,685 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 08:10:03,685 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d6cd821-3b68-4a4d-b987-d3cd99015f8b/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 08:10:03,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:10:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:10:51,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:10:54,546 WARN L832 $PredicateComparison]: unable to prove that (and (= c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0))) (= |c_PADE_2_2_#res| (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven |c_PADE_2_2_#in~x| |c_PADE_2_2_#in~x|))) (fp.div roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse0))))))) is different from false [2018-11-23 08:10:56,898 WARN L832 $PredicateComparison]: unable to prove that (and (= c_ARCTAN_0_1_~x |c_ARCTAN_0_1_#in~x|) (= c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0))) (= (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven c_ARCTAN_0_1_~x c_ARCTAN_0_1_~x))) (fp.div roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse0))))) |c_ARCTAN_0_1_#t~ret0|)) is different from false [2018-11-23 08:10:59,314 WARN L832 $PredicateComparison]: unable to prove that (and (= c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0))) (= (fp.mul roundNearestTiesToEven |c_ARCTAN_0_1_#in~x| (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven |c_ARCTAN_0_1_#in~x| |c_ARCTAN_0_1_#in~x|))) (fp.div roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse0)))))) |c_ARCTAN_0_1_#res|)) is different from false [2018-11-23 08:11:01,993 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt |c_ARCTAN_POS_#in~x| .cse0) (= c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0))) (= |c_ARCTAN_POS_#t~ret1| (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 |c_ARCTAN_POS_#in~x|))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 .cse1))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse2)))))))))) is different from false [2018-11-23 08:11:04,820 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt |c_ARCTAN_POS_#in~x| .cse0) (= c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0))) (= |c_ARCTAN_POS_#res| (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 |c_ARCTAN_POS_#in~x|))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 .cse1))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse2))))))))))) is different from false [2018-11-23 08:11:07,687 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.neg |c_ARCTAN_#in~x|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 .cse3))) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse1 (let ((.cse2 (fp.mul roundNearestTiesToEven .cse0 .cse0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse2)))))))) |c_ARCTAN_#t~ret3|) (= c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0))) (fp.lt |c_ARCTAN_#in~x| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.gt .cse3 .cse1))) is different from false [2018-11-23 08:11:10,517 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.neg |c_ARCTAN_#in~x|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 .cse3))) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse1 (let ((.cse2 (fp.mul roundNearestTiesToEven .cse0 .cse0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse2)))))))) |c_ARCTAN_#t~ret3|) (= c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0))) (fp.lt |c_ARCTAN_#in~x| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.gt .cse3 .cse1))) is different from true [2018-11-23 08:11:13,274 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.neg |c_ARCTAN_#in~x|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.neg (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 .cse3))) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse1 (let ((.cse2 (fp.mul roundNearestTiesToEven .cse0 .cse0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse2))))))))) |c_ARCTAN_#res|) (= c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0))) (fp.lt |c_ARCTAN_#in~x| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.gt .cse3 .cse1))) is different from false [2018-11-23 08:11:16,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.neg |c_ARCTAN_#in~x|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.neg (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (let ((.cse0 (fp.div roundNearestTiesToEven .cse1 .cse3))) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse1 (let ((.cse2 (fp.mul roundNearestTiesToEven .cse0 .cse0))) (fp.div roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse2))))))))) |c_ARCTAN_#res|) (= c_~Pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0))) (fp.lt |c_ARCTAN_#in~x| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.gt .cse3 .cse1))) is different from true [2018-11-23 08:11:19,550 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 (fp.neg main_~a~0))) (and (fp.lt main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.leq main_~a~0 .cse0) (fp.geq main_~a~0 (fp.neg .cse0)) (fp.gt .cse1 .cse2) (= (fp.neg (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 .cse3))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse4))))))))) |c_main_#t~ret6|)))) is different from false [2018-11-23 08:11:22,146 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 (fp.neg main_~a~0))) (and (fp.lt main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.leq main_~a~0 .cse0) (fp.geq main_~a~0 (fp.neg .cse0)) (fp.gt .cse1 .cse2) (= (fp.neg (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 .cse3))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse4))))))))) |c_main_#t~ret6|)))) is different from true [2018-11-23 08:11:24,881 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 (fp.neg main_~a~0))) (and (fp.lt main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.leq main_~a~0 .cse0) (fp.geq main_~a~0 (fp.neg .cse0)) (fp.gt .cse1 .cse2) (= (fp.neg (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 .cse3))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse4))))))))) c_main_~r~0)))) is different from false [2018-11-23 08:11:27,467 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 (fp.neg main_~a~0))) (and (fp.lt main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (fp.leq main_~a~0 .cse0) (fp.geq main_~a~0 (fp.neg .cse0)) (fp.gt .cse1 .cse2) (= (fp.neg (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 .cse3))) (fp.div roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 3.0) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse4))))))))) c_main_~r~0)))) is different from true [2018-11-23 08:11:49,318 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 08:11:49,519 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2018-11-23 08:11:49,520 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-11-23 08:11:49,524 INFO L168 Benchmark]: Toolchain (without parser) took 110053.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 949.2 MB in the beginning and 1.1 GB in the end (delta: -129.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:49,527 INFO L168 Benchmark]: CDTParser took 0.19 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 08:11:49,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.23 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:49,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.36 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:11:49,529 INFO L168 Benchmark]: Boogie Preprocessor took 26.24 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:11:49,530 INFO L168 Benchmark]: RCFGBuilder took 3866.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:49,531 INFO L168 Benchmark]: TraceAbstraction took 105919.84 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: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:49,535 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.19 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 216.23 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.36 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.24 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3866.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 105919.84 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: 55.0 MB). Peak memory consumption was 55.0 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...