./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/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 baa80d60694a6a02d32fddddbbe44c204edcedd1 ....................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/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 baa80d60694a6a02d32fddddbbe44c204edcedd1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:47:02,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:47:02,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:47:02,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:47:02,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:47:02,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:47:02,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:47:02,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:47:02,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:47:02,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:47:02,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:47:02,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:47:02,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:47:02,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:47:02,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:47:02,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:47:02,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:47:02,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:47:02,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:47:02,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:47:02,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:47:02,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:47:02,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:47:02,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:47:02,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:47:02,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:47:02,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:47:02,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:47:02,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:47:02,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:47:02,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:47:02,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:47:02,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:47:02,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:47:02,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:47:02,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:47:02,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:47:02,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:47:02,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:47:02,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:47:02,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:47:02,473 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:47:02,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:47:02,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:47:02,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:47:02,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:47:02,510 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:47:02,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:47:02,511 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:47:02,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:47:02,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:47:02,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:47:02,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:47:02,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:47:02,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:47:02,512 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:47:02,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:47:02,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:47:02,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:47:02,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:47:02,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:47:02,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:47:02,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:47:02,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:47:02,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:47:02,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:47:02,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:47:02,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:47:02,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:47:02,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:47:02,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/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 -> baa80d60694a6a02d32fddddbbe44c204edcedd1 [2019-11-19 21:47:02,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:47:02,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:47:02,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:47:02,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:47:02,711 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:47:02,712 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c [2019-11-19 21:47:02,779 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data/87cf454b8/8e89da8648724d309077fb7b13b88ca5/FLAG3f3c83c0c [2019-11-19 21:47:03,217 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:47:03,218 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/sv-benchmarks/c/float-newlib/double_req_bl_0680a.c [2019-11-19 21:47:03,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data/87cf454b8/8e89da8648724d309077fb7b13b88ca5/FLAG3f3c83c0c [2019-11-19 21:47:03,612 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data/87cf454b8/8e89da8648724d309077fb7b13b88ca5 [2019-11-19 21:47:03,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:47:03,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:47:03,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:47:03,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:47:03,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:47:03,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:03" (1/1) ... [2019-11-19 21:47:03,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219c5dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:03, skipping insertion in model container [2019-11-19 21:47:03,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:03" (1/1) ... [2019-11-19 21:47:03,628 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:47:03,652 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:47:03,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:47:03,942 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:47:03,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:47:04,024 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:47:04,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04 WrapperNode [2019-11-19 21:47:04,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:47:04,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:47:04,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:47:04,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:47:04,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... [2019-11-19 21:47:04,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... [2019-11-19 21:47:04,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:47:04,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:47:04,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:47:04,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:47:04,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... [2019-11-19 21:47:04,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... [2019-11-19 21:47:04,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... [2019-11-19 21:47:04,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... [2019-11-19 21:47:04,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... [2019-11-19 21:47:04,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... [2019-11-19 21:47:04,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... [2019-11-19 21:47:04,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:47:04,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:47:04,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:47:04,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:47:04,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/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 [2019-11-19 21:47:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:47:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-19 21:47:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:47:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 21:47:04,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:47:04,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:47:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 21:47:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-19 21:47:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:47:05,095 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:47:05,096 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-19 21:47:05,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:05 BoogieIcfgContainer [2019-11-19 21:47:05,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:47:05,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:47:05,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:47:05,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:47:05,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:47:03" (1/3) ... [2019-11-19 21:47:05,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f747eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:05, skipping insertion in model container [2019-11-19 21:47:05,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:04" (2/3) ... [2019-11-19 21:47:05,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f747eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:05, skipping insertion in model container [2019-11-19 21:47:05,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:05" (3/3) ... [2019-11-19 21:47:05,104 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680a.c [2019-11-19 21:47:05,111 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:47:05,116 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:47:05,124 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:47:05,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:47:05,152 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:47:05,152 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:47:05,152 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:47:05,152 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:47:05,152 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:47:05,152 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:47:05,153 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:47:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-19 21:47:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 21:47:05,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:05,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:47:05,178 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:05,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-11-19 21:47:05,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:05,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656747508] [2019-11-19 21:47:05,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:05,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656747508] [2019-11-19 21:47:05,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:05,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:47:05,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183623407] [2019-11-19 21:47:05,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:47:05,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:47:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:47:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:47:05,389 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-19 21:47:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:05,431 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-11-19 21:47:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:47:05,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-19 21:47:05,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:05,445 INFO L225 Difference]: With dead ends: 224 [2019-11-19 21:47:05,445 INFO L226 Difference]: Without dead ends: 110 [2019-11-19 21:47:05,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:47:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-19 21:47:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-19 21:47:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-19 21:47:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-11-19 21:47:05,507 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-11-19 21:47:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:05,508 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-11-19 21:47:05,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:47:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-11-19 21:47:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:47:05,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:05,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:47:05,509 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:05,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-11-19 21:47:05,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:47:05,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353952869] [2019-11-19 21:47:05,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:47:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:47:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:47:05,674 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:47:05,674 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:47:05,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:47:05 BoogieIcfgContainer [2019-11-19 21:47:05,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:47:05,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:47:05,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:47:05,712 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:47:05,713 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:05" (3/4) ... [2019-11-19 21:47:05,716 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 21:47:05,716 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:47:05,718 INFO L168 Benchmark]: Toolchain (without parser) took 2102.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. [2019-11-19 21:47:05,718 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:47:05,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:47:05,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.96 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. [2019-11-19 21:47:05,720 INFO L168 Benchmark]: Boogie Preprocessor took 72.92 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:47:05,721 INFO L168 Benchmark]: RCFGBuilder took 930.92 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: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:47:05,721 INFO L168 Benchmark]: TraceAbstraction took 613.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:47:05,722 INFO L168 Benchmark]: Witness Printer took 4.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:47:05,725 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.96 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. * Boogie Preprocessor took 72.92 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 930.92 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: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 613.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 257]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 251, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 256. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L251] double x = -0.0; [L252] double y = -0.0; [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L254] double res = __ieee754_atan2(y, x); [L256] COND TRUE res != -pi VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L257] __VERIFIER_error() VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 161 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 21:47:07,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:47:07,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:47:07,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:47:07,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:47:07,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:47:07,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:47:07,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:47:07,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:47:07,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:47:07,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:47:07,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:47:07,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:47:07,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:47:07,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:47:07,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:47:07,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:47:07,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:47:07,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:47:07,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:47:07,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:47:07,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:47:07,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:47:07,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:47:07,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:47:07,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:47:07,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:47:07,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:47:07,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:47:07,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:47:07,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:47:07,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:47:07,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:47:07,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:47:07,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:47:07,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:47:07,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:47:07,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:47:07,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:47:07,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:47:07,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:47:07,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 21:47:07,634 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:47:07,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:47:07,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:47:07,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:47:07,636 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:47:07,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:47:07,636 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:47:07,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:47:07,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:47:07,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:47:07,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:47:07,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:47:07,638 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 21:47:07,638 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 21:47:07,638 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:47:07,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:47:07,639 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:47:07,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:47:07,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:47:07,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:47:07,640 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:47:07,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:47:07,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:47:07,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:47:07,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:47:07,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:47:07,641 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 21:47:07,641 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 21:47:07,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:47:07,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 21:47:07,642 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/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 -> baa80d60694a6a02d32fddddbbe44c204edcedd1 [2019-11-19 21:47:07,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:47:07,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:47:07,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:47:07,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:47:07,951 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:47:07,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0680a.c [2019-11-19 21:47:08,002 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data/534109ffe/abfdcd29d78547f0876e1704c1bd75ce/FLAG7ba343db9 [2019-11-19 21:47:08,377 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:47:08,378 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/sv-benchmarks/c/float-newlib/double_req_bl_0680a.c [2019-11-19 21:47:08,385 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data/534109ffe/abfdcd29d78547f0876e1704c1bd75ce/FLAG7ba343db9 [2019-11-19 21:47:08,823 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/data/534109ffe/abfdcd29d78547f0876e1704c1bd75ce [2019-11-19 21:47:08,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:47:08,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:47:08,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:47:08,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:47:08,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:47:08,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:08" (1/1) ... [2019-11-19 21:47:08,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4071cfa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:08, skipping insertion in model container [2019-11-19 21:47:08,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:08" (1/1) ... [2019-11-19 21:47:08,840 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:47:08,887 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:47:09,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:47:09,153 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:47:09,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:47:09,291 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:47:09,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09 WrapperNode [2019-11-19 21:47:09,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:47:09,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:47:09,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:47:09,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:47:09,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... [2019-11-19 21:47:09,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... [2019-11-19 21:47:09,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:47:09,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:47:09,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:47:09,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:47:09,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... [2019-11-19 21:47:09,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... [2019-11-19 21:47:09,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... [2019-11-19 21:47:09,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... [2019-11-19 21:47:09,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... [2019-11-19 21:47:09,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... [2019-11-19 21:47:09,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... [2019-11-19 21:47:09,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:47:09,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:47:09,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:47:09,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:47:09,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/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 [2019-11-19 21:47:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-19 21:47:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-19 21:47:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:47:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-19 21:47:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 21:47:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:47:09,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:47:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 21:47:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:47:47,652 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:47:47,652 INFO L285 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-19 21:47:47,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:47 BoogieIcfgContainer [2019-11-19 21:47:47,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:47:47,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:47:47,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:47:47,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:47:47,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:47:08" (1/3) ... [2019-11-19 21:47:47,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53895d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:47, skipping insertion in model container [2019-11-19 21:47:47,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:09" (2/3) ... [2019-11-19 21:47:47,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53895d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:47, skipping insertion in model container [2019-11-19 21:47:47,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:47" (3/3) ... [2019-11-19 21:47:47,661 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680a.c [2019-11-19 21:47:47,670 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:47:47,676 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:47:47,685 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:47:47,707 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:47:47,707 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:47:47,707 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:47:47,707 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:47:47,707 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:47:47,707 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:47:47,708 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:47:47,708 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:47:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-19 21:47:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 21:47:47,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:47,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:47:47,730 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-11-19 21:47:47,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:47:47,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444836461] [2019-11-19 21:47:47,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/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 [2019-11-19 21:47:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:48,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 21:47:48,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:47:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:48,173 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:47:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:48,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444836461] [2019-11-19 21:47:48,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:48,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 21:47:48,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571443759] [2019-11-19 21:47:48,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:47:48,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:47:48,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:47:48,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:47:48,192 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-19 21:47:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:48,218 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-11-19 21:47:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:47:48,219 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-19 21:47:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:48,230 INFO L225 Difference]: With dead ends: 224 [2019-11-19 21:47:48,230 INFO L226 Difference]: Without dead ends: 110 [2019-11-19 21:47:48,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:47:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-19 21:47:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-19 21:47:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-19 21:47:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-11-19 21:47:48,274 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-11-19 21:47:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:48,274 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-11-19 21:47:48,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:47:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-11-19 21:47:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:47:48,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:48,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:47:48,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 21:47:48,493 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:48,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:48,494 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-11-19 21:47:48,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:47:48,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024651000] [2019-11-19 21:47:48,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-19 21:47:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:48,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 21:47:48,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:47:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:49,044 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:47:49,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:49,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:49,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024651000] [2019-11-19 21:47:49,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:49,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-19 21:47:49,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693085129] [2019-11-19 21:47:49,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 21:47:49,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:47:49,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 21:47:49,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:47:49,549 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand 12 states. [2019-11-19 21:47:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:51,549 INFO L93 Difference]: Finished difference Result 161 states and 226 transitions. [2019-11-19 21:47:51,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:47:51,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-11-19 21:47:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:51,551 INFO L225 Difference]: With dead ends: 161 [2019-11-19 21:47:51,552 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 21:47:51,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-19 21:47:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 21:47:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 21:47:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 21:47:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2019-11-19 21:47:51,564 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 12 [2019-11-19 21:47:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:51,565 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2019-11-19 21:47:51,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 21:47:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2019-11-19 21:47:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:47:51,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:51,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:47:51,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 21:47:51,780 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 808768545, now seen corresponding path program 1 times [2019-11-19 21:47:51,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:47:51,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682440544] [2019-11-19 21:47:51,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-19 21:47:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:52,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 21:47:52,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:47:52,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-19 21:47:52,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 21:47:52,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-19 21:47:52,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:47:52,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,259 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-19 21:47:52,260 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:47:52,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,263 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:47:52,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 21:47:52,276 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:19 [2019-11-19 21:47:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:52,322 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:47:52,393 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 39 [2019-11-19 21:47:52,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2019-11-19 21:47:52,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:47:52,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2019-11-19 21:47:52,453 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:47:52,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,457 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:47:52,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:47:52,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 21:47:52,468 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-19 21:47:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:52,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682440544] [2019-11-19 21:47:52,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:52,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-19 21:47:52,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733557268] [2019-11-19 21:47:52,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:47:52,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:47:52,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:47:52,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:47:52,502 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 8 states. [2019-11-19 21:47:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:54,216 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-11-19 21:47:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:47:54,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-19 21:47:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:54,580 INFO L225 Difference]: With dead ends: 125 [2019-11-19 21:47:54,581 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 21:47:54,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:47:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 21:47:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 21:47:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 21:47:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2019-11-19 21:47:54,593 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 17 [2019-11-19 21:47:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:54,594 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2019-11-19 21:47:54,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:47:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2019-11-19 21:47:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:47:54,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:54,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:47:54,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 21:47:54,812 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1532035359, now seen corresponding path program 1 times [2019-11-19 21:47:54,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:47:54,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497687608] [2019-11-19 21:47:54,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-19 21:47:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:55,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 21:47:55,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:47:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:55,256 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:47:55,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:55,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:55,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:55,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497687608] [2019-11-19 21:47:55,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:47:55,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-19 21:47:55,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962750295] [2019-11-19 21:47:55,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:47:55,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:47:55,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:47:55,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:47:55,443 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand 11 states. [2019-11-19 21:47:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:47:58,684 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2019-11-19 21:47:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:47:58,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-11-19 21:47:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:47:58,686 INFO L225 Difference]: With dead ends: 130 [2019-11-19 21:47:58,686 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 21:47:58,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:47:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 21:47:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 21:47:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 21:47:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-11-19 21:47:58,693 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 17 [2019-11-19 21:47:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:47:58,694 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-11-19 21:47:58,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:47:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-11-19 21:47:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:47:58,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:47:58,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:47:58,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 21:47:58,897 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:47:58,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:47:58,898 INFO L82 PathProgramCache]: Analyzing trace with hash -255340040, now seen corresponding path program 1 times [2019-11-19 21:47:58,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:47:58,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801764326] [2019-11-19 21:47:58,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-19 21:47:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:47:59,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 21:47:59,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:47:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:47:59,502 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:47:59,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:59,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:59,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:47:59,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:47:59,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:47:59,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:47:59,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:48:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:00,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801764326] [2019-11-19 21:48:00,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:00,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 14 [2019-11-19 21:48:00,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603936725] [2019-11-19 21:48:00,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 21:48:00,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:48:00,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 21:48:00,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:48:00,149 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 14 states. [2019-11-19 21:48:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:03,048 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-11-19 21:48:03,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:48:03,049 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-11-19 21:48:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:03,052 INFO L225 Difference]: With dead ends: 75 [2019-11-19 21:48:03,052 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 21:48:03,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-11-19 21:48:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 21:48:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 21:48:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 21:48:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-11-19 21:48:03,081 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 18 [2019-11-19 21:48:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:03,081 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-11-19 21:48:03,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 21:48:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-11-19 21:48:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 21:48:03,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:03,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:48:03,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 21:48:03,288 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:03,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:03,288 INFO L82 PathProgramCache]: Analyzing trace with hash 667658140, now seen corresponding path program 1 times [2019-11-19 21:48:03,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:48:03,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922416594] [2019-11-19 21:48:03,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-19 21:48:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:03,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 21:48:03,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:48:04,044 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 21:48:04,380 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-19 21:48:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:04,387 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:48:06,131 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-19 21:48:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:06,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922416594] [2019-11-19 21:48:06,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:06,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-19 21:48:06,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413789830] [2019-11-19 21:48:06,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:48:06,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:48:06,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:48:06,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:48:06,135 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 8 states. [2019-11-19 21:48:06,617 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-19 21:48:06,925 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-19 21:48:07,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:07,783 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-11-19 21:48:07,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:48:07,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-19 21:48:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:07,784 INFO L225 Difference]: With dead ends: 75 [2019-11-19 21:48:07,784 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 21:48:07,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:48:07,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 21:48:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 21:48:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 21:48:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-11-19 21:48:07,802 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2019-11-19 21:48:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:07,803 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-11-19 21:48:07,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:48:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-11-19 21:48:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 21:48:07,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:48:07,804 INFO L410 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] [2019-11-19 21:48:08,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-19 21:48:08,021 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:48:08,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:48:08,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1240434960, now seen corresponding path program 1 times [2019-11-19 21:48:08,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:48:08,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586756069] [2019-11-19 21:48:08,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-19 21:48:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:48:08,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 21:48:08,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:48:08,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:48:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:08,444 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:48:08,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:48:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:48:08,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586756069] [2019-11-19 21:48:08,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:48:08,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-19 21:48:08,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288881803] [2019-11-19 21:48:08,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:48:08,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:48:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:48:08,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:48:08,601 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 11 states. [2019-11-19 21:48:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:48:08,914 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2019-11-19 21:48:08,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:48:08,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-19 21:48:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:48:08,915 INFO L225 Difference]: With dead ends: 71 [2019-11-19 21:48:08,915 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:48:08,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:48:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:48:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:48:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:48:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:48:08,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-19 21:48:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:48:08,917 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:48:08,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:48:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:48:08,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:48:09,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-19 21:48:09,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:48:10,017 WARN L191 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 82 [2019-11-19 21:48:10,019 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-19 21:48:10,019 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-11-19 21:48:10,019 INFO L440 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-11-19 21:48:10,020 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-19 21:48:10,021 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-19 21:48:10,021 INFO L444 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-19 21:48:10,021 INFO L444 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-11-19 21:48:10,021 INFO L444 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-11-19 21:48:10,021 INFO L444 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-11-19 21:48:10,021 INFO L444 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-19 21:48:10,021 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-19 21:48:10,021 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-11-19 21:48:10,021 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 21:48:10,022 INFO L440 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (exists ((v_skolemized_v_prenex_22_5 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64))) (let ((.cse1 (fp.neg (_ +zero 11 53)))) (and (= (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_22_5) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|)) .cse1) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5)) .cse1)))) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))))) (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|) ULTIMATE.start___ieee754_atan2_~hx~1))) (= (bvor ULTIMATE.start___ieee754_atan2_~iy~0 ULTIMATE.start___ieee754_atan2_~ly~0) (_ bv0 32)) (exists ((v_skolemized_v_prenex_22_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_4) ((_ extract 62 52) v_skolemized_v_prenex_22_4) ((_ extract 51 0) v_skolemized_v_prenex_22_4)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_4)) (= ULTIMATE.start___ieee754_atan2_~ly~0 ((_ extract 31 0) v_skolemized_v_prenex_22_4)))) (= (fp.sub roundNearestTiesToEven (fp.neg ~pi~0) .cse2) |ULTIMATE.start___ieee754_atan2_#res|) (= ~tiny_atan2~0 .cse2) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))))) [2019-11-19 21:48:10,022 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-19 21:48:10,022 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-11-19 21:48:10,022 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-19 21:48:10,022 INFO L444 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-11-19 21:48:10,022 INFO L440 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-11-19 21:48:10,022 INFO L444 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-11-19 21:48:10,022 INFO L444 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-19 21:48:10,022 INFO L444 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-11-19 21:48:10,023 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-11-19 21:48:10,023 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-11-19 21:48:10,023 INFO L440 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))))) [2019-11-19 21:48:10,023 INFO L444 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-11-19 21:48:10,023 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 21:48:10,023 INFO L444 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-11-19 21:48:10,023 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-19 21:48:10,023 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-11-19 21:48:10,023 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-19 21:48:10,023 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-11-19 21:48:10,024 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-11-19 21:48:10,024 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-11-19 21:48:10,024 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-11-19 21:48:10,024 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-19 21:48:10,024 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-19 21:48:10,024 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-19 21:48:10,024 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-19 21:48:10,024 INFO L444 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-19 21:48:10,024 INFO L440 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-19 21:48:10,024 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:48:10,024 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-11-19 21:48:10,025 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-11-19 21:48:10,025 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-19 21:48:10,025 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-19 21:48:10,025 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-11-19 21:48:10,025 INFO L440 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))))) (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|) ULTIMATE.start___ieee754_atan2_~hx~1))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))))) [2019-11-19 21:48:10,025 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-19 21:48:10,025 INFO L444 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-11-19 21:48:10,025 INFO L444 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-11-19 21:48:10,025 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-19 21:48:10,026 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 259) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L257(line 257) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-11-19 21:48:10,027 INFO L440 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-11-19 21:48:10,027 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-19 21:48:10,028 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-19 21:48:10,028 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-11-19 21:48:10,028 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:48:10,028 INFO L447 ceAbstractionStarter]: At program point L260(lines 244 261) the Hoare annotation is: true [2019-11-19 21:48:10,028 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-11-19 21:48:10,028 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-19 21:48:10,028 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-11-19 21:48:10,028 INFO L440 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-19 21:48:10,028 INFO L440 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-11-19 21:48:10,028 INFO L440 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-11-19 21:48:10,028 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L444 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L444 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L440 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-11-19 21:48:10,029 INFO L444 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L444 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L444 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-11-19 21:48:10,029 INFO L440 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-11-19 21:48:10,030 INFO L444 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-19 21:48:10,030 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-11-19 21:48:10,030 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:48:10,030 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2019-11-19 21:48:10,030 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-19 21:48:10,030 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-19 21:48:10,030 INFO L440 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-11-19 21:48:10,040 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,041 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,049 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,069 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,069 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,069 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,069 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,076 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:48:10 BoogieIcfgContainer [2019-11-19 21:48:10,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:48:10,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:48:10,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:48:10,081 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:48:10,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:47" (3/4) ... [2019-11-19 21:48:10,084 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:48:10,112 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-19 21:48:10,113 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-19 21:48:10,113 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 21:48:10,150 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) [2019-11-19 21:48:10,151 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_v_prenex_22_5 : bv64, v_skolemized_q#valueAsBitvector_34 : bv64 :: (~bvor32(~bvand32(1bv32, ~bvashr32(v_skolemized_v_prenex_22_5[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(v_skolemized_q#valueAsBitvector_34[63:32], 30bv32))) == m && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(v_skolemized_v_prenex_22_5[63:63], v_skolemized_v_prenex_22_5[62:52], v_skolemized_v_prenex_22_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && ~bvor32(iy, ly) == 0bv32) && (\exists v_skolemized_v_prenex_22_4 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_22_4[63:63], v_skolemized_v_prenex_22_4[62:52], v_skolemized_v_prenex_22_4[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && hy == v_skolemized_v_prenex_22_4[63:32]) && ly == v_skolemized_v_prenex_22_4[31:0])) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) [2019-11-19 21:48:10,230 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a80e4f4d-a349-47a9-8952-e822876ee5e1/bin/uautomizer/witness.graphml [2019-11-19 21:48:10,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:48:10,232 INFO L168 Benchmark]: Toolchain (without parser) took 61405.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 955.1 MB in the beginning and 913.9 MB in the end (delta: 41.2 MB). Peak memory consumption was 250.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:10,232 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:48:10,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:10,233 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.83 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:10,233 INFO L168 Benchmark]: Boogie Preprocessor took 76.45 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:10,234 INFO L168 Benchmark]: RCFGBuilder took 38216.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:10,234 INFO L168 Benchmark]: TraceAbstraction took 22423.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 920.9 MB in the end (delta: 141.8 MB). Peak memory consumption was 199.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:10,234 INFO L168 Benchmark]: Witness Printer took 151.58 ms. Allocated memory is still 1.2 GB. Free memory was 920.9 MB in the beginning and 913.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:48:10,237 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.83 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.45 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 38216.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22423.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 920.9 MB in the end (delta: 141.8 MB). Peak memory consumption was 199.5 MB. Max. memory is 11.5 GB. * Witness Printer took 151.58 ms. Allocated memory is still 1.2 GB. Free memory was 920.9 MB in the beginning and 913.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 257]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 147]: Loop Invariant [2019-11-19 21:48:10,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2019-11-19 21:48:10,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,264 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,265 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) - InvariantResult [Line: 142]: Loop Invariant [2019-11-19 21:48:10,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2019-11-19 21:48:10,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_5,QUANTIFIED] [2019-11-19 21:48:10,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-19 21:48:10,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_4,QUANTIFIED] [2019-11-19 21:48:10,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:48:10,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_v_prenex_22_5 : bv64, v_skolemized_q#valueAsBitvector_34 : bv64 :: (~bvor32(~bvand32(1bv32, ~bvashr32(v_skolemized_v_prenex_22_5[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(v_skolemized_q#valueAsBitvector_34[63:32], 30bv32))) == m && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(v_skolemized_v_prenex_22_5[63:63], v_skolemized_v_prenex_22_5[62:52], v_skolemized_v_prenex_22_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && ~bvor32(iy, ly) == 0bv32) && (\exists v_skolemized_v_prenex_22_4 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_22_4[63:63], v_skolemized_v_prenex_22_4[62:52], v_skolemized_v_prenex_22_4[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && hy == v_skolemized_v_prenex_22_4[63:32]) && ly == v_skolemized_v_prenex_22_4[31:0])) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. Result: SAFE, OverallTime: 22.3s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 560 SDtfs, 1873 SDslu, 656 SDs, 0 SdLazy, 227 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 162 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 210 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 156 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 218 ConstructedInterpolants, 71 QuantifiedInterpolants, 50048 SizeOfPredicates, 58 NumberOfNonLiveVariables, 938 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...