./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/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 bf0ba25fe26682d00fcbd742510a570b9ca53290 ................................................................................................................................................................................................................................................................................................................... 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_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/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 bf0ba25fe26682d00fcbd742510a570b9ca53290 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:54:06,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:54:06,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:54:06,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:54:06,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:54:06,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:54:06,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:54:06,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:54:06,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:54:06,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:54:06,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:54:06,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:54:06,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:54:06,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:54:06,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:54:06,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:54:06,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:54:06,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:54:06,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:54:06,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:54:06,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:54:06,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:54:06,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:54:06,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:54:06,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:54:06,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:54:06,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:54:06,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:54:06,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:54:06,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:54:06,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:54:06,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:54:06,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:54:06,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:54:06,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:54:06,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:54:06,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:54:06,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:54:06,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:54:06,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:54:06,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:54:06,721 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:54:06,734 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:54:06,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:54:06,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:54:06,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:54:06,736 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:54:06,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:54:06,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:54:06,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:54:06,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:54:06,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:54:06,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:54:06,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:54:06,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:54:06,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:54:06,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:54:06,738 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:54:06,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:54:06,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:54:06,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:54:06,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:54:06,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:54:06,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:54:06,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:54:06,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:54:06,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:54:06,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:54:06,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:54:06,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:54:06,741 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_3f9922b2-5a85-476c-975c-e572cff2f7f9/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 -> bf0ba25fe26682d00fcbd742510a570b9ca53290 [2019-11-15 20:54:06,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:54:06,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:54:06,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:54:06,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:54:06,781 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:54:06,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2019-11-15 20:54:06,834 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data/07f344963/9a5b4edf1ac04adbbdb032a6892b7df1/FLAGd35af2f0c [2019-11-15 20:54:07,294 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:54:07,296 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2019-11-15 20:54:07,304 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data/07f344963/9a5b4edf1ac04adbbdb032a6892b7df1/FLAGd35af2f0c [2019-11-15 20:54:07,321 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data/07f344963/9a5b4edf1ac04adbbdb032a6892b7df1 [2019-11-15 20:54:07,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:54:07,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:54:07,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:07,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:54:07,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:54:07,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41672266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07, skipping insertion in model container [2019-11-15 20:54:07,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,343 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:54:07,372 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:54:07,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:07,658 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:54:07,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:07,712 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:54:07,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07 WrapperNode [2019-11-15 20:54:07,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:07,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:07,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:54:07,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:54:07,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:07,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:54:07,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:54:07,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:54:07,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... [2019-11-15 20:54:07,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:54:07,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:54:07,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:54:07,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:54:07,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/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-15 20:54:07,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:54:07,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-15 20:54:07,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:54:07,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 20:54:07,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:54:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:54:07,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:54:07,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-15 20:54:07,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:54:08,256 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:54:08,257 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-15 20:54:08,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:08 BoogieIcfgContainer [2019-11-15 20:54:08,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:54:08,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:54:08,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:54:08,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:54:08,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:54:07" (1/3) ... [2019-11-15 20:54:08,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18255dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:54:08, skipping insertion in model container [2019-11-15 20:54:08,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:07" (2/3) ... [2019-11-15 20:54:08,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18255dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:54:08, skipping insertion in model container [2019-11-15 20:54:08,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:08" (3/3) ... [2019-11-15 20:54:08,265 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621b.c [2019-11-15 20:54:08,274 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:54:08,282 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:54:08,290 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:54:08,315 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:54:08,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:54:08,315 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:54:08,316 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:54:08,316 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:54:08,316 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:54:08,316 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:54:08,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:54:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-11-15 20:54:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:54:08,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:08,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:08,339 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:08,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2019-11-15 20:54:08,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:08,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484386773] [2019-11-15 20:54:08,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:08,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:08,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:08,476 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-15 20:54:08,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484386773] [2019-11-15 20:54:08,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:08,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:54:08,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033652569] [2019-11-15 20:54:08,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:54:08,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:08,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:54:08,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:54:08,494 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-11-15 20:54:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:08,507 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2019-11-15 20:54:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:54:08,508 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 20:54:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:08,517 INFO L225 Difference]: With dead ends: 66 [2019-11-15 20:54:08,518 INFO L226 Difference]: Without dead ends: 31 [2019-11-15 20:54:08,520 INFO L600 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-15 20:54:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-15 20:54:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-15 20:54:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 20:54:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-11-15 20:54:08,551 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2019-11-15 20:54:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:08,551 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-15 20:54:08,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:54:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-11-15 20:54:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 20:54:08,552 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:08,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:08,553 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2019-11-15 20:54:08,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:08,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349434658] [2019-11-15 20:54:08,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:08,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:08,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:08,716 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:08,716 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:54:08,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:54:08 BoogieIcfgContainer [2019-11-15 20:54:08,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:54:08,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:54:08,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:54:08,750 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:54:08,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:08" (3/4) ... [2019-11-15 20:54:08,753 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:54:08,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:54:08,756 INFO L168 Benchmark]: Toolchain (without parser) took 1429.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -117.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:08,756 INFO L168 Benchmark]: CDTParser took 0.18 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-15 20:54:08,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:08,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.45 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-15 20:54:08,758 INFO L168 Benchmark]: Boogie Preprocessor took 32.55 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-15 20:54:08,758 INFO L168 Benchmark]: RCFGBuilder took 462.58 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:08,759 INFO L168 Benchmark]: TraceAbstraction took 490.03 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:08,759 INFO L168 Benchmark]: Witness Printer took 4.30 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-15 20:54:08,762 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.18 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 385.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.45 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 32.55 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. * RCFGBuilder took 462.58 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 490.03 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 145]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of bitwiseAnd at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 144. 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; VAL [aT_atan={1:0}, atanhi_atan={-5:0}, atanlo_atan={-4:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L141] double x = -1.0 / 0.0; [L65] double w, s1, s2, z; [L66] __int32_t ix, hx, id; VAL [aT_atan={1:0}, atanhi_atan={-5:0}, atanlo_atan={-4:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L69] ieee_double_shape_type gh_u; [L70] gh_u.value = (x) [L71] EXPR gh_u.parts.msw [L71] (hx) = gh_u.parts.msw [L73] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-5:0}, atanlo_atan={-4:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L74] COND TRUE ix >= 0x44100000 [L75] __uint32_t low; VAL [aT_atan={1:0}, atanhi_atan={-5:0}, atanlo_atan={-4:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L77] ieee_double_shape_type gl_u; [L78] gl_u.value = (x) [L79] EXPR gl_u.parts.lsw [L79] (low) = gl_u.parts.lsw [L81] COND TRUE ix > 0x7ff00000 || (ix == 0x7ff00000 && (low != 0)) [L82] return x + x; VAL [aT_atan={1:0}, atanhi_atan={-5:0}, atanlo_atan={-4:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L142] double res = atan_double(x); [L144] COND TRUE res != -pi_o_2 VAL [aT_atan={1:0}, atanhi_atan={-5:0}, atanlo_atan={-4:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L145] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-5:0}, atanlo_atan={-4:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 44 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=34occurred 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-cad4683 [2019-11-15 20:54:10,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:54:10,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:54:10,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:54:10,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:54:10,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:54:10,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:54:10,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:54:10,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:54:10,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:54:10,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:54:10,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:54:10,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:54:10,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:54:10,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:54:10,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:54:10,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:54:10,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:54:10,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:54:10,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:54:10,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:54:10,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:54:10,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:54:10,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:54:10,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:54:10,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:54:10,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:54:10,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:54:10,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:54:10,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:54:10,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:54:10,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:54:10,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:54:10,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:54:10,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:54:10,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:54:10,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:54:10,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:54:10,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:54:10,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:54:10,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:54:10,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:54:11,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:54:11,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:54:11,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:54:11,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:54:11,005 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:54:11,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:54:11,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:54:11,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:54:11,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:54:11,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:54:11,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:54:11,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:54:11,006 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:54:11,007 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:54:11,007 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:54:11,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:54:11,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:54:11,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:54:11,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:54:11,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:54:11,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:54:11,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:54:11,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:54:11,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:54:11,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:54:11,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:54:11,010 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:54:11,010 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:54:11,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:54:11,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:54:11,010 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_3f9922b2-5a85-476c-975c-e572cff2f7f9/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 -> bf0ba25fe26682d00fcbd742510a570b9ca53290 [2019-11-15 20:54:11,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:54:11,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:54:11,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:54:11,062 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:54:11,062 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:54:11,063 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2019-11-15 20:54:11,125 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data/f442d1498/cbd98f7b78d54eb2bccd1598f72ac83a/FLAG372da0a3b [2019-11-15 20:54:11,539 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:54:11,540 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2019-11-15 20:54:11,546 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data/f442d1498/cbd98f7b78d54eb2bccd1598f72ac83a/FLAG372da0a3b [2019-11-15 20:54:11,970 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/bin/uautomizer/data/f442d1498/cbd98f7b78d54eb2bccd1598f72ac83a [2019-11-15 20:54:11,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:54:11,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:54:11,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:11,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:54:11,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:54:11,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:11" (1/1) ... [2019-11-15 20:54:11,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711ba079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:11, skipping insertion in model container [2019-11-15 20:54:11,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:11" (1/1) ... [2019-11-15 20:54:11,988 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:54:12,021 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:54:12,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:12,236 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:54:12,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:12,378 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:54:12,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12 WrapperNode [2019-11-15 20:54:12,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:12,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:12,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:54:12,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:54:12,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... [2019-11-15 20:54:12,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... [2019-11-15 20:54:12,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:12,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:54:12,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:54:12,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:54:12,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... [2019-11-15 20:54:12,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... [2019-11-15 20:54:12,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... [2019-11-15 20:54:12,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... [2019-11-15 20:54:12,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... [2019-11-15 20:54:12,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... [2019-11-15 20:54:12,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... [2019-11-15 20:54:12,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:54:12,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:54:12,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:54:12,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:54:12,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/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-15 20:54:12,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-15 20:54:12,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-15 20:54:12,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:54:12,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-15 20:54:12,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 20:54:12,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:54:12,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:54:12,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 20:54:12,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:54:30,032 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:54:30,032 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-15 20:54:30,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:30 BoogieIcfgContainer [2019-11-15 20:54:30,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:54:30,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:54:30,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:54:30,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:54:30,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:54:11" (1/3) ... [2019-11-15 20:54:30,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca0c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:54:30, skipping insertion in model container [2019-11-15 20:54:30,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:12" (2/3) ... [2019-11-15 20:54:30,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca0c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:54:30, skipping insertion in model container [2019-11-15 20:54:30,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:30" (3/3) ... [2019-11-15 20:54:30,040 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621b.c [2019-11-15 20:54:30,049 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:54:30,056 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:54:30,066 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:54:30,087 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:54:30,088 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:54:30,088 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:54:30,088 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:54:30,088 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:54:30,089 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:54:30,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:54:30,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:54:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-11-15 20:54:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:54:30,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:30,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:30,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:30,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2019-11-15 20:54:30,126 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:54:30,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074538654] [2019-11-15 20:54:30,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/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-15 20:54:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:30,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 20:54:30,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:30,409 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-15 20:54:30,409 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:54:30,413 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-15 20:54:30,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074538654] [2019-11-15 20:54:30,415 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:30,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 20:54:30,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784243448] [2019-11-15 20:54:30,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:54:30,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:54:30,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:54:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:54:30,433 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-11-15 20:54:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:30,459 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2019-11-15 20:54:30,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:54:30,460 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 20:54:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:30,476 INFO L225 Difference]: With dead ends: 66 [2019-11-15 20:54:30,477 INFO L226 Difference]: Without dead ends: 31 [2019-11-15 20:54:30,481 INFO L600 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-15 20:54:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-15 20:54:30,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-15 20:54:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 20:54:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-11-15 20:54:30,514 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2019-11-15 20:54:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:30,514 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-15 20:54:30,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:54:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-11-15 20:54:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 20:54:30,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:30,516 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:30,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 20:54:30,717 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2019-11-15 20:54:30,718 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:54:30,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829663076] [2019-11-15 20:54:30,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/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-15 20:54:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:30,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 20:54:30,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:31,131 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-15 20:54:31,134 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:54:31,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:54:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:54:31,429 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-15 20:54:31,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829663076] [2019-11-15 20:54:31,430 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:31,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-15 20:54:31,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808872388] [2019-11-15 20:54:31,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:54:31,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:54:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:54:31,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:54:31,433 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 10 states. [2019-11-15 20:54:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:31,782 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-11-15 20:54:31,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:54:31,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-15 20:54:31,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:54:31,792 INFO L225 Difference]: With dead ends: 35 [2019-11-15 20:54:31,792 INFO L226 Difference]: Without dead ends: 14 [2019-11-15 20:54:31,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:54:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-15 20:54:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 20:54:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:54:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2019-11-15 20:54:31,797 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 12 [2019-11-15 20:54:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:54:31,798 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2019-11-15 20:54:31,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:54:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2019-11-15 20:54:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 20:54:31,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:54:31,799 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:32,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 20:54:32,012 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:54:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1317299133, now seen corresponding path program 1 times [2019-11-15 20:54:32,014 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:54:32,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232397647] [2019-11-15 20:54:32,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f9922b2-5a85-476c-975c-e572cff2f7f9/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-15 20:54:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:32,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 20:54:32,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:32,779 INFO L341 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2019-11-15 20:54:32,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 112 [2019-11-15 20:54:32,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:54:33,021 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-15 20:54:33,022 INFO L567 ElimStorePlain]: treesize reduction 51, result has 65.3 percent of original size [2019-11-15 20:54:33,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 20:54:33,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 20:54:33,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:87, output treesize:96 [2019-11-15 20:54:33,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 20:54:33,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 20:54:33,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 20:54:33,314 INFO L235 Elim1Store]: Index analysis took 134 ms [2019-11-15 20:54:33,517 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-15 20:54:33,517 INFO L341 Elim1Store]: treesize reduction 8, result has 91.1 percent of original size [2019-11-15 20:54:33,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 112 treesize of output 184 [2019-11-15 20:54:33,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:54:33,659 INFO L235 Elim1Store]: Index analysis took 103 ms [2019-11-15 20:54:33,846 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-15 20:54:33,847 INFO L341 Elim1Store]: treesize reduction 8, result has 91.1 percent of original size [2019-11-15 20:54:33,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 117 treesize of output 189 [2019-11-15 20:54:33,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:54:34,117 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-15 20:54:34,118 INFO L341 Elim1Store]: treesize reduction 8, result has 91.1 percent of original size [2019-11-15 20:54:34,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 117 treesize of output 189 [2019-11-15 20:54:34,121 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:54:34,441 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-11-15 20:54:34,441 INFO L341 Elim1Store]: treesize reduction 32, result has 77.3 percent of original size [2019-11-15 20:54:34,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 119 treesize of output 216 [2019-11-15 20:54:34,444 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:54:36,058 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-11-15 20:54:36,058 INFO L567 ElimStorePlain]: treesize reduction 429, result has 34.0 percent of original size [2019-11-15 20:54:36,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:54:36,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:54:36,202 INFO L235 Elim1Store]: Index analysis took 105 ms [2019-11-15 20:54:36,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:54:36,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 151 [2019-11-15 20:54:36,314 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:54:36,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:54:36,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:54:36,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:54:36,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 151 [2019-11-15 20:54:36,421 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:55:09,292 WARN L191 SmtUtils]: Spent 32.87 s on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-11-15 20:55:09,293 INFO L567 ElimStorePlain]: treesize reduction 51, result has 83.4 percent of original size [2019-11-15 20:55:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:09,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-11-15 20:55:09,296 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:466, output treesize:257 [2019-11-15 20:55:09,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:09,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:39,811 WARN L191 SmtUtils]: Spent 30.46 s on a formula simplification that was a NOOP. DAG size: 138 [2019-11-15 20:55:39,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:55:39,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:56:45,468 WARN L191 SmtUtils]: Spent 1.05 m on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2019-11-15 20:56:45,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:56:45,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:56:45,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:56:45,910 INFO L235 Elim1Store]: Index analysis took 289 ms [2019-11-15 20:56:45,976 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:56:45,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 185 [2019-11-15 20:56:45,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:56:46,118 INFO L235 Elim1Store]: Index analysis took 115 ms [2019-11-15 20:56:46,201 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:56:46,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 133 treesize of output 179 [2019-11-15 20:56:46,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:56:46,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:56:46,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 171 [2019-11-15 20:56:46,383 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:56:47,026 WARN L191 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-15 20:56:47,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:56:47,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:56:47,198 INFO L235 Elim1Store]: Index analysis took 109 ms [2019-11-15 20:56:47,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:56:47,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 150 [2019-11-15 20:56:47,255 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:56:47,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:56:47,421 INFO L235 Elim1Store]: Index analysis took 136 ms [2019-11-15 20:56:47,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:56:47,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:56:47,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 168 [2019-11-15 20:56:47,503 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:56:47,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:56:47,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:56:47,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:56:47,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:56:47,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 156 [2019-11-15 20:56:47,681 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:57:05,077 WARN L191 SmtUtils]: Spent 17.40 s on a formula simplification. DAG size of input: 187 DAG size of output: 176 [2019-11-15 20:57:05,078 INFO L567 ElimStorePlain]: treesize reduction 50, result has 88.6 percent of original size [2019-11-15 20:57:05,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:05,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:05,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 21 dim-0 vars, and 3 xjuncts. [2019-11-15 20:57:05,086 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 21 variables, input treesize:406, output treesize:355 [2019-11-15 20:57:05,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:05,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:05,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:31,955 WARN L191 SmtUtils]: Spent 20.78 s on a formula simplification. DAG size of input: 195 DAG size of output: 134 [2019-11-15 20:57:31,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:31,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:38,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:38,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:44,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:44,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:44,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:44,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:44,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:44,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:57:44,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:57:44,560 INFO L235 Elim1Store]: Index analysis took 239 ms [2019-11-15 20:57:44,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:57:44,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 205 treesize of output 111 [2019-11-15 20:57:44,571 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:57:45,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:57:46,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:57:56,365 INFO L235 Elim1Store]: Index analysis took 10688 ms [2019-11-15 20:57:56,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 91 [2019-11-15 20:57:56,369 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:57:56,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:57:56,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:57:56,751 INFO L235 Elim1Store]: Index analysis took 168 ms [2019-11-15 20:57:56,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:57:56,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:57:56,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:57:56,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:57:56,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 195 treesize of output 113 [2019-11-15 20:57:56,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:56,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:57:56,785 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:57:58,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:58:01,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:58:01,385 INFO L235 Elim1Store]: Index analysis took 2521 ms [2019-11-15 20:58:02,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:58:03,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:58:04,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:58:04,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:58:04,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 133 [2019-11-15 20:58:04,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:58:04,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:58:04,087 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:58:42,147 WARN L191 SmtUtils]: Spent 38.06 s on a formula simplification. DAG size of input: 146 DAG size of output: 121 [2019-11-15 20:58:42,147 INFO L567 ElimStorePlain]: treesize reduction 115, result has 71.5 percent of original size [2019-11-15 20:58:42,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:58:42,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2019-11-15 20:58:42,156 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 19 variables, input treesize:801, output treesize:276 [2019-11-15 20:58:45,074 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 135 DAG size of output: 39 [2019-11-15 20:58:46,166 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 20:58:46,244 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-15 20:58:46,245 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:58:55,162 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-15 20:58:55,166 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-15 20:58:55,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232397647] [2019-11-15 20:58:55,166 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:58:55,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-11-15 20:58:55,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780788289] [2019-11-15 20:58:55,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 20:58:55,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:58:55,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 20:58:55,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=112, Unknown=6, NotChecked=0, Total=156 [2019-11-15 20:58:55,168 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 13 states. [2019-11-15 20:59:20,642 WARN L191 SmtUtils]: Spent 20.59 s on a formula simplification. DAG size of input: 160 DAG size of output: 148 [2019-11-15 20:59:33,901 WARN L191 SmtUtils]: Spent 12.52 s on a formula simplification. DAG size of input: 211 DAG size of output: 116 [2019-11-15 20:59:50,704 WARN L191 SmtUtils]: Spent 15.59 s on a formula simplification. DAG size of input: 242 DAG size of output: 147 [2019-11-15 21:00:09,910 WARN L191 SmtUtils]: Spent 18.44 s on a formula simplification. DAG size of input: 246 DAG size of output: 151 [2019-11-15 21:00:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:00:09,911 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-11-15 21:00:09,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:00:09,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-11-15 21:00:09,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:00:09,912 INFO L225 Difference]: With dead ends: 14 [2019-11-15 21:00:09,912 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:00:09,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 217.5s TimeCoverageRelationStatistics Valid=84, Invalid=182, Unknown=6, NotChecked=0, Total=272 [2019-11-15 21:00:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:00:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:00:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:00:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:00:09,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-11-15 21:00:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:00:09,913 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:00:09,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 21:00:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:00:09,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:00:10,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 21:00:10,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:00:18,056 WARN L191 SmtUtils]: Spent 7.86 s on a formula simplification that was a NOOP. DAG size: 181 [2019-11-15 21:00:24,325 WARN L191 SmtUtils]: Spent 6.27 s on a formula simplification that was a NOOP. DAG size: 139 [2019-11-15 21:00:34,568 WARN L191 SmtUtils]: Spent 10.24 s on a formula simplification that was a NOOP. DAG size: 155 [2019-11-15 21:00:34,571 INFO L443 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-15 21:00:34,571 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-15 21:00:34,571 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-15 21:00:34,571 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-15 21:00:34,571 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:00:34,571 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:00:34,571 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 147) no Hoare annotation was computed. [2019-11-15 21:00:34,571 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 21:00:34,571 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-15 21:00:34,571 INFO L439 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-15 21:00:34,572 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-15 21:00:34,572 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-15 21:00:34,572 INFO L443 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-15 21:00:34,572 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 21:00:34,572 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-15 21:00:34,572 INFO L443 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L439 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: (and (or (and (exists ((v_prenex_37 (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_37) ((_ extract 62 52) v_prenex_37) ((_ extract 51 0) v_prenex_37))) (= (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_37)) (= (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_37))))) (not (= |~#atanhi_atan~0.offset| |~#atanlo_atan~0.offset|)) (not (= (bvadd |~#atanlo_atan~0.offset| (_ bv4 32)) |~#atanhi_atan~0.offset|)) (exists ((v_prenex_36 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_36) ((_ extract 62 52) v_prenex_36) ((_ extract 51 0) v_prenex_36)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_36))))) (and (exists ((v_skolemized_v_prenex_13_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_13_3) ((_ extract 62 52) v_skolemized_v_prenex_13_3) ((_ extract 51 0) v_skolemized_v_prenex_13_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_skolemized_v_prenex_13_3)))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (let ((.cse1 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select .cse1 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ extract 31 0) v_skolemized_v_prenex_12_3) (select .cse1 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)))))))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_19_3) ULTIMATE.start_atan_double_~hx~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x))) (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (= ULTIMATE.start_atan_double_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_11|) ULTIMATE.start_atan_double_~low~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~ix~0))) (exists ((|~#aT_atan~0.base| (_ BitVec 32))) (and (not (= |~#aT_atan~0.base| |~#atanhi_atan~0.base|)) (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_prenex_45 (_ BitVec 64)) (v_prenex_46 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_46) ((_ extract 62 52) v_prenex_46) ((_ extract 51 0) v_prenex_46)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0)) (fp ((_ extract 63 63) v_prenex_45) ((_ extract 62 52) v_prenex_45) ((_ extract 51 0) v_prenex_45))) (= (let ((.cse3 ((_ extract 63 32) v_prenex_46))) (fp.sub roundNearestTiesToEven (fp.neg (let ((.cse2 (concat .cse3 ((_ extract 31 0) v_prenex_46)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (let ((.cse4 (concat ((_ extract 63 32) v_prenex_45) .cse3))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) |ULTIMATE.start_atan_double_#res|))) (exists ((v_skolemized_v_prenex_19_4 (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64))) (let ((.cse5 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanlo_atan~0.base|)) (.cse6 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|))) (and (not .cse5) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse5) (= ((_ extract 63 32) v_skolemized_v_prenex_19_4) (select .cse6 (_ bv4 32))) (= (select |#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 1)) (= (select .cse6 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_12|)))))) [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L446 ceAbstractionStarter]: At program point L148(lines 134 149) the Hoare annotation is: true [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-15 21:00:34,573 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-15 21:00:34,574 INFO L439 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_19_3) ULTIMATE.start_atan_double_~hx~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x))) (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (= ULTIMATE.start_atan_double_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (let ((.cse1 (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))))) (or (and (exists ((v_prenex_37 (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_37) ((_ extract 62 52) v_prenex_37) ((_ extract 51 0) v_prenex_37))) (= (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_37)) (= (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_37))))) (not (= |~#atanhi_atan~0.offset| |~#atanlo_atan~0.offset|)) (not (= (bvadd |~#atanlo_atan~0.offset| (_ bv4 32)) |~#atanhi_atan~0.offset|)) .cse1 (exists ((v_prenex_36 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_36) ((_ extract 62 52) v_prenex_36) ((_ extract 51 0) v_prenex_36)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_36))))) (and (exists ((v_skolemized_v_prenex_13_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_13_3) ((_ extract 62 52) v_skolemized_v_prenex_13_3) ((_ extract 51 0) v_skolemized_v_prenex_13_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_skolemized_v_prenex_13_3)))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) .cse1 (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (let ((.cse2 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select .cse2 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ extract 31 0) v_skolemized_v_prenex_12_3) (select .cse2 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))))))))) (exists ((v_skolemized_v_prenex_19_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_19_3) ((_ extract 62 52) v_skolemized_v_prenex_19_3) ((_ extract 51 0) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~x) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_19_3)) ULTIMATE.start_atan_double_~ix~0))) (exists ((|~#aT_atan~0.base| (_ BitVec 32))) (and (not (= |~#aT_atan~0.base| |~#atanhi_atan~0.base|)) (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_skolemized_v_prenex_19_4 (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64))) (let ((.cse3 (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanlo_atan~0.base|)) (.cse4 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|))) (and (not .cse3) (or (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) .cse3) (= ((_ extract 63 32) v_skolemized_v_prenex_19_4) (select .cse4 (_ bv4 32))) (= (select |#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 1)) (= (select .cse4 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_12|)))))) [2019-11-15 21:00:34,574 INFO L443 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-15 21:00:34,574 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-15 21:00:34,574 INFO L439 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: (and (exists ((|~#aT_atan~0.base| (_ BitVec 32))) (and (not (= |~#aT_atan~0.base| |~#atanhi_atan~0.base|)) (not (= |~#aT_atan~0.base| |~#atanlo_atan~0.base|)) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#atanlo_atan~0.base| (_ bv0 32)) (= (_ bv0 32) |~#atanhi_atan~0.base|) (= |~#aT_atan~0.base| (_ bv0 32))) (= (bvadd (select |#valid| |~#aT_atan~0.base|) (_ bv1 1)) (_ bv0 1)))) (= (bvadd (select |#valid| |~#atanlo_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |#valid| |~#atanhi_atan~0.base|) (_ bv1 1)) (_ bv0 1)) (= ULTIMATE.start_atan_double_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (or (and (exists ((v_skolemized_v_prenex_13_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_13_3) ((_ extract 62 52) v_skolemized_v_prenex_13_3) ((_ extract 51 0) v_skolemized_v_prenex_13_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_skolemized_v_prenex_13_3)))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (exists ((v_skolemized_v_prenex_19_4 (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32)) (v_prenex_40 (_ BitVec 32)) (v_prenex_39 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|))) (and (not (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanlo_atan~0.base|)) (not (= |~#atanlo_atan~0.base| v_prenex_40)) (= (select .cse0 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_12|)) (not (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| |~#atanhi_atan~0.base|)) (= (select (select |#memory_int| v_prenex_40) (_ bv4 32)) ((_ extract 63 32) v_prenex_39)) (not (= v_prenex_40 |~#atanhi_atan~0.base|)) (or (= ((_ extract 63 32) v_skolemized_v_prenex_19_4) (select .cse0 (_ bv4 32))) (= |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| v_prenex_40)))))) (and (not (= |~#atanhi_atan~0.offset| |~#atanlo_atan~0.offset|)) (exists ((v_prenex_35 (_ BitVec 32)) (v_prenex_33 (_ BitVec 64)) (v_skolemized_v_prenex_20_3 (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| (_ BitVec 32)) (v_prenex_38 (_ BitVec 64))) (let ((.cse1 (select |#memory_int| v_prenex_35))) (and (or (= ((_ extract 63 32) v_prenex_33) (select .cse1 (_ bv4 32))) (= v_prenex_35 |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|)) (not (= |~#atanlo_atan~0.base| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|)) (not (= v_prenex_35 |~#atanhi_atan~0.base|)) (= (select (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|) (_ bv4 32)) ((_ extract 63 32) v_skolemized_v_prenex_20_3)) (= ((_ extract 31 0) v_prenex_38) (select .cse1 (_ bv0 32))) (not (= v_prenex_35 |~#atanlo_atan~0.base|)) (not (= |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| |~#atanhi_atan~0.base|))))) (not (= (bvadd |~#atanlo_atan~0.offset| (_ bv4 32)) |~#atanhi_atan~0.offset|)) (exists ((v_prenex_36 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_36) ((_ extract 62 52) v_prenex_36) ((_ extract 51 0) v_prenex_36)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_36)))))) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (let ((.cse2 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_12_3) (select .cse2 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32)))) (= ((_ extract 31 0) v_skolemized_v_prenex_12_3) (select .cse2 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))))))) [2019-11-15 21:00:34,580 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:00:34,584 INFO L168 Benchmark]: Toolchain (without parser) took 382611.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 947.0 MB in the beginning and 976.6 MB in the end (delta: -29.6 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:00:34,585 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:00:34,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:00:34,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.13 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:00:34,586 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 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-15 21:00:34,587 INFO L168 Benchmark]: RCFGBuilder took 17552.64 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:00:34,588 INFO L168 Benchmark]: TraceAbstraction took 364548.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 128.8 MB). Peak memory consumption was 177.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:00:34,591 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.13 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.54 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. * RCFGBuilder took 17552.64 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 364548.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 128.8 MB). Peak memory consumption was 177.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...